Search results

Paper A method for transforming grammars into LL(k) form 1979-01-01 Paper On the covering problem for left-recursive grammars 1979-01-01 Paper On a method...

1983-01-01 Paper On the relationship between LL(1) and LR(1) grammars 1982-01-01 Paper Two iteration theorems for the LL(k) languages 1980-01-01 Paper...

Context-Free Grammars 1980-01-01 Paper Program Testing Complexity and Test Criteria 1980-01-01 Paper Immediate error detection in strong LL(1) parsers 1979-01-01...

context-free grammars 1983-01-01 Paper A note on the parallel computation thesis 1983-01-01 Paper On the power of chain rules in context free grammars 1982-01-01...

programs 1978-01-01 Paper A direct algorithm for checking equivalence of LL(k) grammars 1977-01-01 Paper Backtracking in recursive computations 1977-01-01 Paper...

Publication Type Characterization of extended \(\mathrm{LR}(k)\) grammars 2016-05-26 Paper A Powerful LL(k) Covering Transformation 2006-06-01 Paper On the prediction...

Paper A Powerful LL(k) Covering Transformation 2006-06-01 Paper An LR parser with pre-determined reduction goals 2002-07-25 Paper Grammar coverings of a...

attribute-grammar framework for specifying the accessibility in Java programs 2003-05-04 Paper A finest partitioning algorithm for attribute grammars 2000-09-14...

problems 1991-01-01 Paper Speed of parsing the languages generated by LL(K) and LC(K)-grammars 1988-01-01 Paper Tabular dependencies and their implication problems...

https://portal.mardi4nfdi.de/entity/Q4728265 1985-01-01 Paper On the complexity of LL(k) testing 1983-01-01 Paper A Syntax-Error-Handling Technique and Its Experimental...

A method for transforming grammars into LL(k) form 1979-01-01 Paper The nonexistence of some covering context-free grammars 1979-01-01 Paper https://portal...

structural equivalence 1997-10-08 Paper Structural equivalence and ET0L grammars 1997-02-27 Paper https://portal.mardi4nfdi.de/entity/Q4942249 1996-01-01...

https://portal.mardi4nfdi.de/entity/Q2708964 2003-07-09 Paper Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower...