Right nulled GLR parsers
暂无分享,去创建一个
[1] Peter T. Breuer,et al. A prettier compiler‐compiler: Generating higher‐order parsers in C , 1995, Softw. Pract. Exp..
[2] Stefan Jähnichen. Compiler construction : 8th international conference, CC '99, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999 : proceedings , 1999 .
[3] Giorgio Satta,et al. Tabular Parsing , 2004, ArXiv.
[4] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.
[5] F. L. Deremer,et al. Practical translators for LR(k) languages , 1969 .
[6] Adrian Johnstone,et al. Generalised Regular Parsers , 2003, CC.
[7] David R. Hanson,et al. A research C# compiler , 2004, Softw. Pract. Exp..
[8] Tadao Kasami,et al. An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages , 1965 .
[9] Franklin L. DeRemer,et al. Simple LR(k) grammars , 1971, Commun. ACM.
[10] Stephen H. Unger. A global parser for context-free phrase structure grammars , 1968, CACM.
[11] Jay Earley,et al. An efficient context-free parsing algorithm , 1970, Commun. ACM.
[12] Adrian Johnstone,et al. Generalised reduction modified LR parsing for domain specific language prototyping , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.
[13] Leslie G. Valiant,et al. General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..
[14] Adrian Johnstone,et al. Reducing non-determinism in right nulled GLR parsers , 2004, Acta Informatica.
[15] Adrian Johnstone,et al. The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms , 2004, LDTA@ETAPS.
[16] G J van den BrandMark,et al. Compiling language definitions , 2002 .
[17] Daniel H. Younger,et al. Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..
[18] Alfred V. Aho,et al. Deterministic parsing of ambiguous grammars , 1975, Commun. ACM.
[19] Rahman Nozohoor-Farshi. GLR Parsing for ε-Grammers , 1991 .
[20] Terence Parr. Language Translation Using PCCTS and C , 1999 .
[21] Masaru Tomita,et al. Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .
[22] Masaru Tomita,et al. Efficient parsing for natural language , 1985 .
[23] Donald E. Knuth,et al. On the Translation of Languages from Left to Right , 1965, Inf. Control..
[24] Paul Klint,et al. Compiling language definitions: the ASF+SDF compiler , 2000, TOPL.
[25] J. Rekers,et al. Parser Generation for Interactive Environments , 1992 .
[26] Harry Bunt,et al. Recent Advances in Parsing Technology , 1996 .
[27] George C. Necula,et al. Elkhound: A Fast, Practical GLR Parser Generator , 2003, CC.
[28] Edgar T. Irons,et al. A syntax directed compiler for ALGOL 60 , 1961, CACM.
[29] Giorgio Satta,et al. Efficient Tabular LR Parsing , 1996, ACL.
[30] Bernard Lang,et al. The Structure of Shared Forests in Ambiguous Parsing , 1989, ACL.
[31] Adrian Johnstone,et al. Generalised Parsing: Some Costs , 2004, CC.
[32] Richard Edwin Stearns,et al. Syntax-Directed Transduction , 1966, JACM.
[33] Mark-Jan Nederhof,et al. Increasing the Applicability of LR Parsing , 1993, IWPT.
[34] Michael A. Harrison,et al. Parsing of General Context-Free Languages , 1976, Adv. Comput..
[35] Bjarne Stroustrup,et al. The Design and Evolution of C , 1994 .
[36] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .
[37] Adrian Johnstone,et al. Generalised Recursive Descent parsing and Fellow-Determinism , 1998, CC.
[38] Eelco Visser,et al. Program Transformation with Stratego/XT: Rules, Strategies, Tools, and Systems in Stratego/XT 0.9 , 2003, Domain-Specific Program Generation.
[39] Mark-Jan Nederhof,et al. An Optimal Tabular Parsing Algorithm , 1994, ACL.