A parsing automata approach to LR theory
type: Item
instance of: scholarly article
title: A parsing automata approach to LR theory
zbMATH Open document ID: 0469.68086
DOI: 10.1016/0304-3975(81)90067-0
author: Stephan Heilbrunner
published in: Theoretical Computer Science
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 3737064
zbMATH Keywords: item grammars
zbMATH Keywords: correct prefix parsers operating in linear time
zbMATH Keywords: LR grammars
MaRDI profile type: Publication
full work available at URL: 0304-3975(81)90067-0
OpenAlex ID: W1970158213
cites work: Q4050097
cites work: Optimization of LR(k) parsers
cites work: Q4068115
cites work: Efficient LR(1) parsers
cites work: An alternative approach to the improvement of LR(k) parsers
cites work: LR-regular grammars - an extension of LR(k) grammars
cites work: Simple LR(k) grammars
cites work: On LR(k) grammars and languages
cites work: Characteristic parsing: A framework for producing compact deterministic parsers. II
cites work: Q4057550
cites work: Q4770505
cites work: Truly prefix-correct chain-free LR(1) parsers
cites work: Q5592246
cites work: Compiler construction. An advanced course
cites work: Lower Bounds and Reductions Between Grammar Problems
cites work: Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems''
cites work: On the complexity of LR(k) testing
cites work: On the translation of languages from left to right
cites work: Application of regular canonical systems to grammars translatable from left to right
cites work: A practical general method for constructing LR(k) parsers
cites work: Eliminating unit productions from LR parsers
cites work: Q4041108
cites work: Properties of deterministic top-down grammars
cites work: Q5678435
cites work: Q4136590
cites work: Concerning bounded-right-context grammars
description: scientific article; zbMATH DE number 3737064