Tabular parsing and algebraic transformations

DOI10.1016/S0304-3975(01)00352-8zbMath1025.68046OpenAlexW2070752979MaRDI QIDQ1870575

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

zbMATH Keywords

transformationgrammarsalgebralinear indexedparser constructiontabular parsing

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

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

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