On the translation of languages from left to right
From MaRDI portal
Publication:5639365
DOI10.1016/S0019-9958(65)90426-2zbMath0231.68027OpenAlexW2064490449WikidataQ29397695 ScholiaQ29397695MaRDI QIDQ5639365
Publication date: 1966
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(65)90426-2
Related Items
Unnamed Item, The theory of languages, The theory of languages, A note on top-down deterministic languages, If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser, Suffix languages in Lr parsing, Formal grammars for turn-bounded deterministic context-free languages, Unnamed Item, A syntax-directed parser for recalcitrant grammars, The size of LALR (1) parsers, Unnamed Item, Unnamed Item, Unnamed Item, Syntax checking either way, On comparingLL(k) andLR(k) grammars, Precedence-regular grammars, Parsers for indexed grammars, GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS, Lar(m, c, l) grammars, Hierarchic syntax error repair for LR grammars, Deterministic grammars and grammar morphisms, A linear-time simulation of deterministic \(d\)-limited automata, A Yacc extension for LRR grammar parsing, Conjunctive grammars and alternating pushdown automata, Input-driven languages are linear conjunctive, A programming language with an expandable grammar, LR(k)-coupled-context-free grammars, Syntactic adaptability of programming languages, Syntactic recognizer for expandable languages, Generalized LR Parsing for Grammars with Contexts, Recognition is not parsing - SPPF-style parsing from cubic recognisers, Syntax checking either way, Epsilon weak precedence grammars and languages, A loop-free algorithm for generating the linear extensions of a poset, Parallel parsing on the connection machine, Generalized LR parsing algorithm for grammars with one-sided contexts, Parsing schemata and correctness of parsing algorithms, PHRASE parsers from multi-axiom grammars, A syntactic approach based on distortion-tolerant Adjacency Grammars and a spatial-directed parser to interpret sketched diagrams, Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization, A method for transforming grammars into LL(k) form, Conjunctive and Boolean grammars: the true general case of the context-free grammars, From regular expressions to DFA's using compressed NFA's, A hierarchy of deterministic languages, Generalized overlap resolvable grammars and their parsers, Parsing extended LR(k) grammars, Analyzing Ambiguity of Context-Free Grammars, On the space optimizing effect of eliminating single productions from LR parsers, Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement, LR(0) grammars generated by LR(0) parsers, A parsing automata approach to LR theory, Generalizing input-driven languages: theoretical and practical benefits, Diagnostics on LALR(k) conflicts based on a method for LR(k) testing, Extending lookahead for LR parsers, SR(s,k) parsers: A class of shift-reduce bounded-context parsers, Practical arbitrary lookahead LR parsing, New techniques for proving the decidability of equivalence problem, On LLP(k) parsers, On LLP(k) grammars and languages, On the relationship between the LL(k) and LR(k) grammars, On the incremental growth and shrinkage of LR goto-graphs, Equivalence of deterministic pushdown automata revisited, LR parsing for LCFRS, A general model for fixed look-ahead lr parsers, Optimization of LR(\(k\)) reduced parsers, LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata, Regular languages viewed from a graph-theoretic perspective, On the reduction of \(LR(k)\) parsers, A normal form algorithm for regular differential chains, An improved bound for detecting looping configurations in deterministic PDA's, Efficient parsing algorithms for general context-free parsers, Ambiguity and precedence in syntax description, A note on the ambiguity of context-free grammars, Attributed translations, Analyzing ambiguity of context-free grammars, Transductions des langages de Chomsky, LR-parsing of extended context free grammars, A Scheme for LR(k) parsing with error recovery, Resolution of ambiguity in parsing, The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution, A representation theorem of infinite dimensional algebras and applications to language theory, Deterministic Pushdown Automata and Unary Languages, Normal forms of deterministic grammars, An alternative approach to the improvement of LR(k) parsers, A practical general method for constructing LR(k) parsers, On LR(k) grammars and languages, The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency, Characteristic parsing: A framework for producing compact deterministic parsers. I, Characteristic parsing: A framework for producing compact deterministic parsers. II, Fast deterministic parsers for transition networks, Complexity metatheorems for context-free grammar problems, LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata, A definition of measures over language space, Syntactic stochastic processes: definitions, models, and related inference problems, Computing representations for radicals of finitely generated differential ideals, Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata, SLR(k) covering for LR(k) grammars, Decidability of the equivalence problem for deterministic pushdown automata, DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES, LR(k) grammars and deterministic languages, Pair grammars, graph languages and string-to-graph translations, Top-down syntax nalysis, Unilateral context sensitive grammars and left-to-right parsing, Efficient LR(1) parsers, Equivalence of programs with structured variables, LR-regular grammars - an extension of LR(k) grammars, Generation, recognition and parsing of context-free languages by means of recursive graphs, Strict deterministic grammars, Anwendung von Graphenalgorithmen auf allgemeinere Problemklassen, Application of regular canonical systems to grammars translatable from left to right, A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages, Lower bounds on the size of deterministic parsers, LALR(1,1) parser generation for regular right part grammars, \(L(A)=L(B)\)? decidability results from complete formal systems, On the complexity of LL(k) testing, Parsing as abstract interpretation of grammar semantics, Upper bounds on the size of LR(k) parsers, A note on one-pass evaluation of attribute grammars, Precedence technique is not worse than SLR(1), Boundedly \(\text{LR}(k)\)-conflictable grammars
