Practical arbitrary lookahead LR parsing
type: Item
instance of: scholarly article
title: Practical arbitrary lookahead LR parsing
zbMATH Open document ID: 0698.68070
DOI: 10.1016/0022-0000(90)90037-L
author: Manuel E. Bermudez
author: Karl M. Schimpf
published in: Journal of Computer and System Sciences
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4145357
zbMATH Keywords: LR parsing
zbMATH Keywords: lookahead
zbMATH Keywords: context-free grammars
describes a project that uses: COBOL
describes a project that uses: PL/I
describes a project that uses: YACC
describes a project that uses: Ada95
MaRDI profile type: Publication
cites work: Efficient LR(1) parsers
cites work: Extending lookahead for LR parsers
cites work: LR-regular grammars - an extension of LR(k) grammars
cites work: Simple LR(k) grammars
cites work: Efficient Computation of LALR(1) Look-Ahead Sets
cites work: Q4198075
cites work: On the translation of languages from left to right
cites work: A practical method for constructing LR ( k ) processors
cites work: Methods for Computing LALR( k ) Lookahead
cites work: A practical general method for constructing LR(k) parsers
cites work: A new analysis of LALR formalisms
cites work: The Complexity of LALR (k) Testing
full work available at URL: 0022-0000(90)90037-l
OpenAlex ID: W1989313238
description: scientific article; zbMATH DE number 4145357