On the translation of languages from left to right
From MaRDI portal
Publication:5639365
DOI10.1016/S0019-9958(65)90426-2zbMath0231.68027WikidataQ29397695 ScholiaQ29397695MaRDI QIDQ5639365
Publication date: 1966
Published in: Information and Control (Search for Journal in Brave)
Related Items
Lar(m, c, l) grammars, Suffix languages in Lr parsing, Unnamed Item, Unnamed Item, GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS, The theory of languages, The theory of languages, A note on top-down deterministic languages, A syntax-directed parser for recalcitrant grammars, A representation theorem of infinite dimensional algebras and applications to language theory, On the reduction of \(LR(k)\) parsers, SLR(k) covering for LR(k) grammars, Lower bounds on the size of deterministic parsers, On the complexity of LL(k) testing, Practical arbitrary lookahead LR parsing, New techniques for proving the decidability of equivalence problem, LALR(1,1) parser generation for regular right part grammars, 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), Deterministic grammars and grammar morphisms, A Yacc extension for LRR grammar parsing, Parallel parsing on the connection machine, Parsing schemata and correctness of parsing algorithms, PHRASE parsers from multi-axiom grammars, A method for transforming grammars into LL(k) form, A hierarchy of deterministic languages, Parsing extended LR(k) grammars, On the space optimizing effect of eliminating single productions from LR parsers, LR(0) grammars generated by LR(0) parsers, A parsing automata approach to LR theory, 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, On LLP(k) parsers, On LLP(k) grammars and languages, On the relationship between the LL(k) and LR(k) grammars, Optimization of LR(\(k\)) reduced parsers, 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, Transductions des langages de Chomsky, LR-parsing of extended context free grammars, Resolution of ambiguity in parsing, 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, Complexity metatheorems for context-free grammar problems, A definition of measures over language space, Boundedly \(\text{LR}(k)\)-conflictable grammars, LR(k)-coupled-context-free grammars, From regular expressions to DFA's using compressed NFA's, Generalized overlap resolvable grammars and their parsers, \(L(A)=L(B)\)? decidability results from complete formal systems, Decidability of the equivalence problem for deterministic pushdown automata, A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages, Parsing as abstract interpretation of grammar semantics, A programming language with an expandable grammar, Syntactic adaptability of programming languages, Syntactic recognizer for expandable languages, A loop-free algorithm for generating the linear extensions of a poset, Equivalence of deterministic pushdown automata revisited, 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, Epsilon weak precedence grammars and languages, Analyzing Ambiguity of Context-Free Grammars, Deterministic Pushdown Automata and Unary Languages, A general model for fixed look-ahead lr parsers, Unnamed Item, A Scheme for LR(k) parsing with error recovery, On comparingLL(k) andLR(k) grammars, Precedence-regular grammars, Hierarchic syntax error repair for LR grammars, Unnamed Item, The size of LALR (1) parsers, Parsers for indexed grammars
