On the size of parsers and \(\text{LR}(k)\)-grammars
type: Item
instance of: scholarly article
title: On the size of parsers and \(\text{LR}(k)\)-grammars
zbMATH Open document ID: 0944.68083
DOI: 10.1016/S0304-3975(98)00199-6
author: Detlef Wotschke
author: Hing-Man Leung
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 1493351
zbMATH Keywords: parsing
zbMATH Keywords: grammar
zbMATH Keywords: descriptional complexity
MaRDI profile type: Publication
cites work: Economy of description by parsers, DPDA's, and PDA's
cites work: Early error detection in syntax-driven parsers
cites work: Q4040864
Recommended article: Upper bounds on the size of LR(k) parsers
Recommended article: On LR(k)-Parsers of Polynomial Size
Recommended article: On the reduction of \(LR(k)\) parsers
Recommended article: Lower bounds on the size of deterministic parsers
Recommended article: Size/lookahead tradeoff for \(LL(k)\)-grammars
Recommended article: On the size of unambiguous context-free grammars
Recommended article: Q4062661
Recommended article: Complexity of Extended vs. Classic LR Parsers
Recommended article: Q3327739
Recommended article: Q4359806
description: scientific article; zbMATH DE number 1493351