Grammar Coverings of a Deterministic Parser with Action Conflicts
暂无分享,去创建一个
[1] Harry B. Hunt,et al. Efficient algorithms for automatic construction and compactification of parsing , 1987, TOPL.
[2] Kai Koskimies,et al. The design of a language processor generator , 1988, Softw. Pract. Exp..
[3] M. Dennis Mickunas,et al. On the Complete Covering Problem for LR(k)Grammars , 1976, J. ACM.
[4] Alan J. Demers,et al. Skeletal LR Parsing , 1974, SWAT.
[5] Frank DeRemer,et al. Efficient computation of LALR(1) look-ahead sets , 2004, SIGP.
[6] Myung-Joon Lee,et al. SLR(k) Covering for LR(k) Grammars , 1991, Inf. Process. Lett..
[7] Murray Hill,et al. Yacc: Yet Another Compiler-Compiler , 1978 .
[8] Alfred V. Aho,et al. Deterministic parsing of ambiguous grammars , 1975, Commun. ACM.