USSA—universal syntax and semantics analyzer
暂无分享,去创建一个
[1] S. Doaitse Swierstra,et al. Higher order attribute grammars , 1989, PLDI '89.
[2] Tim Teitelbaum,et al. Higher-order attribute grammars and editing environments , 1990, PLDI '90.
[3] Jorma Tarhio. LR Parsing of Some Ambiguous Grammars , 1982, Inf. Process. Lett..
[4] Alfonso Caracciolo Di Forino,et al. Some remarks on the syntax of symbolic programming languages , 1963, CACM.
[5] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[6] Boris Burshteyn. On the modification of the formal grammar at parse time , 1990, SIGP.
[7] George H. Roberts. A note on modifiable grammars , 1991, SIGP.
[8] Boris Burshteyn,et al. Generation and recognition of formal languages by modifiable grammars , 1990, SIGP.
[9] Donald E. Knuth,et al. On the Translation of Languages from Left to Right , 1965, Inf. Control..
[10] Phillip Edward Garrison,et al. Modeling and Implementation of Visibility in Programming Languages , 1987 .
[11] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.
[12] Verónica Dahl,et al. Logic Grammars , 1989, Symbolic Computation.
[13] Bjarne Stroustrup,et al. The Annotated C++ Reference Manual , 1990 .
[14] Michael A. Klug,et al. VisiCola, a model and a language for visibility control in programming languages , 1991, SIGP.
[15] Steven P. Reiss. Generation of Compiler Symbol Processing Mechanisms from Specifications , 1983, TOPL.
[16] Henning Christiansen,et al. A survey of adaptable grammars , 1990, SIGP.