On the size of parsers and LR(k)-grammars
暂无分享,去创建一个
In this paper, we consider two tradeoff results regarding the economy of description in parsing. One result is on the tradeoff between the size of a parser and its ability to detect an error early. The other result is on the tradeoff between the size of an LR(k)-grammar and the length k of the lookahead.
[1] Harry B. Hunt,et al. Economy of description by parsers, DPDA's, and PDA's , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[2] A. V. Moura,et al. Early Error Detection in Syntax-Driven Parsers , 1986, IBM J. Res. Dev..
[3] Eljas Soisalon-Soininen,et al. LR(k) and LL(k) parsing , 1990 .
[4] Jozef Gruska. Descriptional Complexity of Context-Free Languages , 1973, MFCS.