Tabular parsing and algebraic transformations

DOI10.1016/S0304-3975(01)00352-8zbMATH Open1025.68046OpenAlexW2070752979MaRDI QIDQ1870575FDOQ1870575

Authors: Karl-Michael Schneider 

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00352-8

Recommendations

• scientific article; zbMATH DE number 2150299
• Tabulation of automata for tree-adjoining languages
• scientific article; zbMATH DE number 2085263
• Information flow in tabular interpretations for generalized push-down automata
• scientific article; zbMATH DE number 6851912

zbMATH Keywords

transformationalgebragrammarslinear indexedparser constructiontabular parsing

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• The equivalence of four extensions of context-free grammars
• Title not available (Why is that?)
• Principles and implementation of deductive parsing
• A homomorphism theorem for partial algebras
• Parsing schemata and correctness of parsing algorithms
• A characterization of strong homomorphisms
• Title not available (Why is that?)
• On mappings between quasi-algebras
• On systems of mappings between models
• Remarks on lattices of congruence relations of quasi-algebras

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tabulation of automata for tree-adjoining languages

This page was built for publication: Tabular parsing and algebraic transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870575)