1 |
Wagner A., and Graham S., "Incremental analysis of real programing languages.", Proceedings of ACM PLDI '97, 1997
|
2 |
Reckers J. and Koorn W., "Substring parsing for arbitrary context-free grammars" ACM SIGPLAN Notices,, 26(5), pp.59-66, 1991
|
3 |
Grune D., Jacobs C., Parsing Techniques: A Practical Guide, Ellis Horwood Limited, 1998
|
4 |
Jalili F. and Gallier J., "Building Friendly Parsers", Proceedings of 9th ACM POPL, pp.196-206, 1982
|
5 |
Aho, A.V., Sethi R., and Ullman J. D., Compilers: Principles, Techniques and Tools, Addison-Wesley, 1986
|
6 |
Nozohoor-Farshi R., "GLR parsing for -grammars.", Generalized LR Parsing, pp.61-75, Kluwer Academic Pubkishers, 1991
|
7 |
Larchéveque J.M., "Optimal Incremental Parsing", ACM TOPLAS, Vol.17 ,No.1, pp.1-15, 1995
DOI
|
8 |
Snelting G., "How to build LR parsers which accept incomplete input", ACM SIGPLAN Notices, vol. 25, no. 4, pp.83-89, 1990
DOI
|
9 |
Bates, J. and Lavie A.,"Recognizing Substring of LR(K) Languages in Linear Time", ACM TOPLAS, Vol.16, No.3, pp.1051-1077, 1994
DOI
ScienceOn
|