Deterministic parsing of ambiguous grammars

DOI10.1145/360933.360969MaRDI QIDQ4065004zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1975

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/360933.360969

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(11)

• Looping LR parsers
• Two iteration theorems for the LL(k) languages
• Resolution of ambiguity in parsing
• Grammar coverings of a deterministic parser with action conflicts
• Context-free relations and their characteristics
• Integrating code generation and peephole optimization
• An experimental ambiguity detection tool
• A characterization ofLL(1) grammars
• Mathematical typography
• Precedences in specifications and implementations of programming languages
• On conservative extensions of syntax in system development

This page was built for publication: Deterministic parsing of ambiguous grammars

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