Deterministic parsing of ambiguous grammars

DOI10.1145/360933.360969zbMATH Open0307.68002OpenAlexW2094283151WikidataQ128126512 ScholiaQ128126512MaRDI QIDQ4065004FDOQ4065004

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)

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

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)