The following pages link to (Q4068115):
Displaying 45 items.
- On the reduction of \(LR(k)\) parsers (Q688231) (← links)
- An improved LALR\((k)\) parser generation for regular right part grammars (Q689632) (← links)
- A region analysis algorithm for the live variables problem (Q799117) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- Composition and evaluation of attribute coupled grammars (Q1099964) (← links)
- PHRASE parsers from multi-axiom grammars (Q1129132) (← links)
- A method for transforming grammars into LL(k) form (Q1134533) (← links)
- On the space optimizing effect of eliminating single productions from LR parsers (Q1143813) (← links)
- On parsing two-level grammars (Q1143815) (← links)
- Two iteration theorems for the LL(k) languages (Q1148695) (← links)
- LR(0) grammars generated by LR(0) parsers (Q1151056) (← links)
- Pathlistings applied to data flow analysis (Q1155957) (← links)
- A parsing automata approach to LR theory (Q1157181) (← links)
- Diagnostics on LALR(k) conflicts based on a method for LR(k) testing (Q1157919) (← links)
- Testing attribute grammars for circularity (Q1162165) (← links)
- Decompiling context-free languages from their Polish-like representations (Q1163872) (← links)
- Translations on a subclass of LR(k) grammars (Q1166940) (← links)
- Optimization of LR(\(k\)) ''reduced parsers'' (Q1186566) (← links)
- An implementation of syntax directed functional programming on nested- stack machines (Q1194207) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- An \(O(n)\) algorithm for computing the set of available expressions of D-charts (Q1220380) (← links)
- Fuzzy logic and approximate reasoning (Q1222643) (← links)
- Resolution of ambiguity in parsing (Q1230647) (← links)
- An alternative approach to the improvement of LR(k) parsers (Q1238428) (← links)
- A practical general method for constructing LR(k) parsers (Q1238429) (← links)
- The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency (Q1239010) (← links)
- Monotone data flow analysis frameworks (Q1245693) (← links)
- On the completeness of a set of transformations optimizing linear programs (Q1248335) (← links)
- A left part theorem for grammatical trees (Q1251905) (← links)
- The concept of a linguistic variable and its application to approximate reasoning. I (Q1253933) (← links)
- Program transformations and algebraic semantics (Q1254849) (← links)
- The concept of a linguistic variable and its application to approximate reasoning. II (Q1256861) (← links)
- The concept of a linguistic variable and its application to approximate reasoning. III (Q1256862) (← links)
- Simple chain grammars and languages (Q1259175) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- Recent advances of grammatical inference (Q1390941) (← links)
- A probabilistic model of computing with words (Q1776375) (← links)
- Fast algorithms for the elimination of common subexpressions (Q1846330) (← links)
- Decomposition of directed graphs and the Turán problem (Q2260873) (← links)
- Composing stack-attributed tree transducers (Q2272204) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Table design in dynamic programming (Q2509355) (← links)
- Standard-cell placement from functional descriptions (Q2640581) (← links)
- On comparingLL(k) andLR(k) grammars (Q3878763) (← links)
- A note on weak operator precedence grammars (Q5906151) (← links)
