scientific article; zbMATH DE number 3485226
From MaRDI portal
Publication:4068115
Cited in
(45)- Decomposition of directed graphs and the Turán problem
- On the space optimizing effect of eliminating single productions from LR parsers
- On the completeness of a set of transformations optimizing linear programs
- Resolution of ambiguity in parsing
- Composition and evaluation of attribute coupled grammars
- A probabilistic model of computing with words
- On comparingLL(k) andLR(k) grammars
- A parsing automata approach to LR theory
- A practical general method for constructing LR(k) parsers
- The equivalence of bottom-up and top-down tree-to-graph transducers
- Fuzzy logic and approximate reasoning
- The concept of a linguistic variable and its application to approximate reasoning. II
- The word problem for visibly pushdown languages described by grammars
- The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency
- Efficient symbolic analysis of programs
- PHRASE parsers from multi-axiom grammars
- On the reduction of \(LR(k)\) parsers
- An improved LALR\((k)\) parser generation for regular right part grammars
- Standard-cell placement from functional descriptions
- LR(0) grammars generated by LR(0) parsers
- An alternative approach to the improvement of LR(k) parsers
- Optimization of LR(\(k\)) reduced parsers
- A left part theorem for grammatical trees
- Monotone data flow analysis frameworks
- Pathlistings applied to data flow analysis
- Diagnostics on LALR(k) conflicts based on a method for LR(k) testing
- Testing attribute grammars for circularity
- Tree transducers with external functions
- Decompiling context-free languages from their Polish-like representations
- Translations on a subclass of LR(k) grammars
- Composing stack-attributed tree transducers
- Recent advances of grammatical inference
- A note on weak operator precedence grammars
- Simple chain grammars and languages
- Table design in dynamic programming
- A method for transforming grammars into LL(k) form
- An implementation of syntax directed functional programming on nested- stack machines
- Fast algorithms for the elimination of common subexpressions
- A region analysis algorithm for the live variables problem
- An \(O(n)\) algorithm for computing the set of available expressions of D-charts
- The concept of a linguistic variable and its application to approximate reasoning. I
- The concept of a linguistic variable and its application to approximate reasoning. III
- On parsing two-level grammars
- Program transformations and algebraic semantics
- Two iteration theorems for the LL(k) languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068115)
