A parsing automata approach to LR theory

DOI10.1016/0304-3975(81)90067-0zbMath0469.68086OpenAlexW1970158213MaRDI QIDQ1157181

Stephan Heilbrunner

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90067-0

zbMATH Keywords

LR grammarscorrect prefix parsers operating in linear timeitem grammars

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (8)

A Yacc extension for LRR grammar parsing ⋮ Graph Parsing as Graph Transformation ⋮ On the relationship between the LL(k) and LR(k) grammars ⋮ On the correct elimination of chain productions from lr parsers ⋮ On the reduction of \(LR(k)\) parsers ⋮ Measuring nondeterminism in pushdown automata ⋮ Tests for the LR-, LL-, and LC-regular conditions ⋮ Measuring nondeterminism in pushdown automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compiler construction. An advanced course
• Eliminating unit productions from LR parsers
• Concerning bounded-right-context grammars
• An alternative approach to the improvement of LR(k) parsers
• A practical general method for constructing LR(k) parsers
• On LR(k) grammars and languages
• Characteristic parsing: A framework for producing compact deterministic parsers. II
• Truly prefix-correct chain-free LR(1) parsers
• Efficient LR(1) parsers
• LR-regular grammars - an extension of LR(k) grammars
• Optimization of LR(k) parsers
• Application of regular canonical systems to grammars translatable from left to right
• On the complexity of LR(k) testing
• Lower Bounds and Reductions Between Grammar Problems
• Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems
• Properties of deterministic top-down grammars
• Simple LR(k) grammars
• On the translation of languages from left to right

This page was built for publication: A parsing automata approach to LR theory