On the relationship between the LL(k) and LR(k) grammars
type: Item
instance of: scholarly article
title: On the relationship between the LL(k) and LR(k) grammars
zbMATH Open document ID: 0491.68081
DOI: 10.1016/0020-0190(82)90038-2
author: Anton Nijholt
published in: Information Processing Letters
publication date: 1982-01-01T00:00:00Z
full work available at URL: on-the-relationship-between-the-llk-and-lrk-grammars(3c58248c-d00c-4686-8552-21006e07ca51).html
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3772986
zbMATH Keywords: inclusion of the class of LL(k) grammars into the class of LR(k) grammars
MaRDI profile type: Publication
OpenAlex ID: W2151709274
cites work: Q3862436
cites work: Two iteration theorems for the LL(k) languages
cites work: On the relationship between LL(1) and LR(1) grammars
cites work: Design of a separable transition-diagram compiler
cites work: Simple LR(k) grammars
cites work: Q4185830
cites work: On LR(k) grammars and languages
cites work: Characteristic parsing: A framework for producing compact deterministic parsers. II
cites work: Q4770505
cites work: Q4166243
cites work: Q4198075
cites work: On the Parsing of Deterministic Languages
cites work: A parsing automata approach to LR theory
cites work: Lower Bounds and Reductions Between Grammar Problems
cites work: On the translation of languages from left to right
cites work: Top-down syntax nalysis
cites work: A note on the number of states of the De Remer's recognizer
cites work: Syntax-Directed Transduction
cites work: A Formalization of Transition Diagram Systems
cites work: Simple chain grammars and languages
cites work: Q3911427
cites work: On LLP(k) grammars and languages
cites work: Properties of deterministic top-down grammars
cites work: On comparingLL(k) andLR(k) grammars
cites work: A method for transforming grammars into LL(k) form
description: scientific article; zbMATH DE number 3772986