Noncanonical Extensions of Bottom-Up Parsing Techniques

DOI10.1137/0205019zbMath0373.68048OpenAlexW2051274456MaRDI QIDQ4151162

Thomas G. Szymanski, John H. Williams

Publication date: 1976

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6913

Mathematics Subject Classification ID

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

Related Items (12)

Deterministic grammars and grammar morphisms ⋮ Some observations on LR-like parsing with delayed reduction ⋮ An experimental ambiguity detection tool ⋮ Unnamed Item ⋮ Left-to-right regular languages and two-way restarting automata ⋮ A Note on Decidable Separability by Piecewise Testable Languages ⋮ Unnamed Item ⋮ A predictive bottom-up parser ⋮ Bounded-connect noncanonical discriminating-reverse parsers. ⋮ Complexity metatheorems for context-free grammar problems ⋮ A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages ⋮ Boundedly \(\text{LR}(k)\)-conflictable grammars

This page was built for publication: Noncanonical Extensions of Bottom-Up Parsing Techniques