Syntax-Directed Transduction
From MaRDI portal
Publication:5549060
DOI10.1145/321466.321477zbMath0164.32102OpenAlexW2048808408WikidataQ56224611 ScholiaQ56224611MaRDI QIDQ5549060
Richard E. Stearns, Philip Lewis
Publication date: 1968
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321466.321477
Related Items (65)
Some formal results about stratificational grammars and their relevance to linguistics ⋮ On the Transformation of LL(k)-linear Grammars to LL(1)-linear ⋮ A general theory of translation ⋮ Reversible top-down syntax analysis ⋮ Generating languages by a derivation procedure for elementary formal systems ⋮ Notes on top-down languages ⋮ A note on top-down deterministic languages ⋮ Recursive descent parsing for Boolean grammars ⋮ Mappings and grammars on trees ⋮ Automated generation of program translation and verification tools using annotated grammars ⋮ Parallel parsing on the connection machine ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ PHRASE parsers from multi-axiom grammars ⋮ Streaming algorithms for language recognition problems ⋮ Predictive Top-Down Parsing for Hyperedge Replacement Grammars ⋮ A method for transforming grammars into LL(k) form ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ On the transformation of LL\((k)\)-linear to LL(1)-linear grammars ⋮ Generalized overlap resolvable grammars and their parsers ⋮ Hierarchical Phrase-Based Translation ⋮ Programming language ALGOL 68 ⋮ Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement ⋮ Symbolic encoding of LL(1) parsing and its applications ⋮ Two iteration theorems for the LL(k) languages ⋮ Reversible Top-Down Syntax Analysis ⋮ Interdependent translation schemes ⋮ A syntax-directed parser for recalcitrant grammars ⋮ Semantic preserving translations ⋮ Translations on a subclass of LR(k) grammars ⋮ Unnamed Item ⋮ On the relationship between the LL(k) and LR(k) grammars ⋮ Predictive parser combinators need four values to report errors ⋮ Producing a top-down parse order with bottom-up parsing ⋮ Unnamed Item ⋮ A characterization ofLL(1) grammars ⋮ Unnamed Item ⋮ On coupled languages and translations ⋮ Efficient parsing algorithms for general context-free parsers ⋮ On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers ⋮ Are two context-free languages translatable in a syntax-directed translation scheme? ⋮ Attributed translations ⋮ Translation grammars for compilation and decompilation ⋮ LL-regular grammars ⋮ Unnamed Item ⋮ Abstract families of relations ⋮ A representation theorem of infinite dimensional algebras and applications to language theory ⋮ Normal forms of deterministic grammars ⋮ On LR(k) grammars and languages ⋮ The ELL(1) parser generator and the error recovery mechanism ⋮ On comparingLL(k) andLR(k) grammars ⋮ Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari ⋮ LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Properties of syntax directed translations ⋮ Syntax directed translations and the pushdown assembler ⋮ Generalized sequential machine maps ⋮ LR(k) grammars and deterministic languages ⋮ Pair grammars, graph languages and string-to-graph translations ⋮ Top-down syntax nalysis ⋮ Efficient LR(1) parsers ⋮ Generation, recognition and parsing of context-free languages by means of recursive graphs ⋮ Theory of formal grammars ⋮ On the complexity of LL(k) testing ⋮ Synchronous context-free grammars and optimal linear parsing strategies
This page was built for publication: Syntax-Directed Transduction
