Deterministic parsing of ambiguous grammars

DOI10.1145/360933.360969zbMath0307.68002OpenAlexW2094283151WikidataQ128126512 ScholiaQ128126512MaRDI QIDQ4065004

No author found.

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

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

Related Items (11)

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

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