Methods for Computing LALR(k) Lookahead
暂无分享,去创建一个
[1] Bent Bruun Kristensen,et al. A General Algorithm for Solving a Set of Recursive Equations: Exemplified by LR-theory , 1980 .
[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[3] Alfred V. Aho,et al. Principles of Compiler Design , 1977 .
[4] Frank DeRemer,et al. Efficient computation of LALR(1) look-ahead sets , 1979, SIGPLAN '79.
[5] Bent Bruun Kristensen,et al. The BOBS-System , 1982 .
[6] Dhiraj K. Pradhan,et al. A graph-structural approach for the generalization of data management systems , 1977, Inf. Sci..
[7] Vernon E Altman. A Language Implementation System , 1974 .
[8] Frank DeRemer,et al. Efficient computation of LALR(1) look-ahead sets , 2004, SIGP.
[9] Murray Hill,et al. Yacc: Yet Another Compiler-Compiler , 1978 .
[10] Alfred V. Aho,et al. Principles of Compiler Design (Addison-Wesley series in computer science and information processing) , 1977 .
[11] David Pager,et al. The lane-tracing algorithm for constructing LR (k) parsers and ways of enhancing its efficiency , 1977, Inf. Sci..
[12] Alfred V. Aho,et al. Optimization of LR(k) Parsers , 1972, J. Comput. Syst. Sci..
[13] F. L. Deremer,et al. Practical translators for LR(k) languages , 1969 .
[14] J. J. Horning,et al. Efficient LR(1) Parsers , 1971 .
[15] Franklin L. DeRemer,et al. Simple LR(k) grammars , 1971, Commun. ACM.
[16] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .