Syntax checking either way

DOI10.1016/j.tcs.2023.114000OpenAlexW4379744627MaRDI QIDQ6100187

Uwe Meyer, Martin Kutrib

Publication date: 21 June 2023

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114000

zbMATH Keywords

decidabilityclosure propertiesdeterministic pushdown automatadescriptional complexityexpressive capacitysyntax checkingreversals of deterministic context-free languages

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• 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
• Syntax checking either way
• 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
• THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS

This page was built for publication: Syntax checking either way