Syntax checking either way

DOI10.1007/978-3-031-07469-1_10OpenAlexW4285259961MaRDI QIDQ2164743

Uwe Meyer, Martin Kutrib

Publication date: 16 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07469-1_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Syntax checking either way

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds on the size of deterministic parsers
• Context-dependent nondeterminism for pushdown automata
• A pushdown automaton or a context-free grammar - which is more economical?
• Economy of description by parsers, DPDA's, and PDA's
• On the size of parsers and \(\text{LR}(k)\)-grammars
• Top-down syntax nalysis
• Measuring nondeterminism in pushdown automata
• A note on the succinctness of descriptions of deterministic languages
• Deterministic context free languages
• Finite-Turn Pushdown Automata
• The Unsolvability of the Recognition of Linear Context-Free Languages
• On the translation of languages from left to right