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