2000 The Fortran I Compiler_1648326536661.pdf
A Bibliography of Publications about the Fortran Programming Language Part 1 1956 to 1980_1648326536756.pdf
Knuth1962 Invited Papers History of Writing Compilers_1648326536931.pdf
PPT2014 A history of Compilers Construction_1648326537059.pdf
ACM Queue2013 Intermediate Representation_1648326537357.pdf
TOPLAS1987 (Ferrante) The Program Dependence Graph and Its Use in Optimization_1648326537411.pdf
TOPLAS1991 Efficiently Computing Single Static Assignment Form and the Control Dependence Graph_1648326537697.pdf
(1965) An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages_1648326538200.pdf
(2014) BoB Best of Both in Compiler Construction – Bottom-up Parsing with Top-down Semantic Evaluation_1648326539317.pdf
(Dain 1991) Bibliography on Syntax Error Handling in Language Translation Systems_1648326539571.pdf
(Knuth 1971) Top-down Syntax Analysis_1648326539609.pdf
A Bibliography on Syntax Error Handling in Context Free Languages_1648326539768.pdf
ANTLR A Predicated-LL(k) Parser Generator_1648326539916.pdf
ActaInfo1971 (Knuth) Top-Down Syntax Analysis_1648326540074.pdf
Adaptive LL(Star) Parsing The Power of Dynamic Analysis (ALLStar)_1648326540178.pdf
CACM1963 (Conway) Design of a Separable Transition-diagram Compiler_1648326540354.pdf
CACM1969 (Korenjak) A Practical Method for Constructing LR(k) Processors_1648326540677.pdf
CACM1970 An Efficient Context-free Parsing Algorithm_1648326540846.pdf
CACM1971 (Deremer) Simple LR(k) Grammars_1648326540941.pdf
CACM1975 (Aho) Deterministic Parsing of Ambiguous Grammars_1648326541088.pdf
Deterministic Techniques for Efficient Non-Deterministic Parsers (GLR)_1648326541201.pdf
ICALP2008 Analyzing Context-Free Grammars Using an Incremental SAT Solver_1648326541229.pdf
InformationAndControl (1965 Knuth) On the Translation of Languages from Left to Right_1648326541275.pdf
JACM1968 (Lewis; Stearns) Syntax-Directed Transduction_1648326541464.pdf
JACM1982 On the Relationship between LL(1) and LR(1) Grammars_1648326541610.pdf
LL(STAR) The Foundation of the ANTLR Parser Generator (Terence Parr)_1648326541767.pdf
PhDThesis1969 (MIT; Deremer) Practical Translators for LR(k) Languages_1648326542016.pdf
SIGPLAN Notices2011 LL(star) The Foundation of the ANTLR Parser Generator_1648326542946.pdf
STOC1974 A New Grammatical Transformation into LL(k) Form (Extended Abstract)_1648326543094.pdf
TCS1981 (Heilbrunner) A Parsing Automata Approach to LR Theory_1648326543224.pdf
TOPLAS1982 Efficient Computation of LALR(1) Look-Ahead Sets_1648326543577.pdf
TOPLAS2017 A Simple Possibly Correct LR Parser for C11_1648326543795.pdf
arXiv2020 2005.06444 Pika Parsing_1648326543912.pdf
Can Programming be Liberated from The von Neumann Style A Functional Style and its Algebra of Programs_1648326544156.pdf
The Structure of a Programming Language Resolution_1648326544441.pdf
Hopcroft(1971 CS-TR-71-190) An nlogn Algorithm for Minimizing States in a Finite Automation_1648326544702.pdf
Minimal NFA Problems are Hard_1648326544885.pdf
Rabin and Scott (1959) Finite Automata and Their Decision Problems_1648326545184.pdf
Scheme2006 An Incremental Approach to Compiler Construction_1648326545349.pdf
CACM1975 The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars_1648326532997.pdf
CSUR1995 (Jukka Paakki) Attribute Grammar Paradigms A High-level Methodology in Language Implementation_1648326533195.pdf
Extending Bison with Attribute Grammars (Thesis)_1648326533678.pdf
JACM1962 A General Translation Program for Phrase Structure Languages_1648326533807.pdf
JACM1968 Syntax-Directed Transduction_1648326533890.pdf
JACM1981 A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars_1648326534060.pdf
JStor2004 What is Formal in Formal Semantics_1648326534125.pdf
Knuth (1990) The Genesis of Attribute Grammars_1648326534208.pdf
Knuth1967 Semantics of Context-Free Languages (Attributed Grammar; AG)_1648326534340.pdf
Knuth1971 Examples of Formal Semantics_1648326534508.pdf
POPL1989 Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis (Preliminary Version)_1648326534684.pdf
TOPLAS1990 Efficient Evaluation of Circular Attribute Grammars_1648326534875.pdf
arXiv (Wu) On Exponential-Time Completeness of the Circularity Problem for Attributed Grammars_1648326535161.pdf
CACM1962 (Floyd) On Ambiguity in Phrase Structure Languages_1648326535261.pdf
InformationAndControl1960 Note on the Boolean Properties of Context Free Languages_1648326535320.pdf
InformationAndControl1964 Inherent Ambiguity of Minimal Linear Grammars_1648326535392.pdf
Musical L-Systems (Stelios Manousakis)_1648326535456.pdf
PhDThesis1988 Rewrite Systems Pattern Matching and Code Generation_1648326535761.pdf
WWW2004 Enforcing Strict Model-View Separation in Template Engines_1648326536508.pdf
(Johnson 1979) A Tour Through the Portable C Compiler_1648326536619.pdf