On LR(k) grammars and languages

DOI10.1016/0304-3975(77)90013-5zbMath0357.68083OpenAlexW2008754898MaRDI QIDQ1239009

Michael A. Harrison, Matthew M. Geller

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0304-3975(77)90013-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

A Yacc extension for LRR grammar parsing ⋮ A hierarchy of deterministic languages ⋮ Two iteration theorems for the LL(k) languages ⋮ A parsing automata approach to LR theory ⋮ A hierarchy of real-time deterministic languages and their equivalence ⋮ On LLP(k) grammars and languages ⋮ On the relationship between the LL(k) and LR(k) grammars ⋮ A Scheme for LR(k) parsing with error recovery ⋮ Normal forms of deterministic grammars ⋮ On the covering of parsable grammars ⋮ Characteristic parsing: A framework for producing compact deterministic parsers. I ⋮ Characteristic parsing: A framework for producing compact deterministic parsers. II ⋮ On comparingLL(k) andLR(k) grammars ⋮ On equivalence and subclass containment problems for deterministic context-free languages ⋮ Simple chain grammars and languages ⋮ Ll-regular grammars ⋮ A new definition for simple precedence grammars ⋮ On LC(0) grammars and languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characteristic parsing: A framework for producing compact deterministic parsers. II
• LR(k) grammars and deterministic languages
• Strict deterministic grammars
• Short monotone formulae for the majority function
• On the Parsing of Deterministic Languages
• Deterministic context free languages
• A regularity test for pushdown machines
• Syntax-Directed Transduction
• On the translation of languages from left to right
• Real-Time Strict Deterministic Languages

This page was built for publication: On LR(k) grammars and languages