Syntax-Directed Transduction
From MaRDI portal
Cited in
(66)- Parallel parsing on the connection machine
- Power properties of NLC graph grammars with a polynomial membership problem
- PHRASE parsers from multi-axiom grammars
- A method for transforming grammars into LL(k) form
- Programming language ALGOL 68
- Two iteration theorems for the LL(k) languages
- Interdependent translation schemes
- Translations on a subclass of LR(k) grammars
- On the relationship between the LL(k) and LR(k) grammars
- Efficient parsing algorithms for general context-free parsers
- Are two context-free languages translatable in a syntax-directed translation scheme?
- Attributed translations
- LL-regular grammars
- Normal forms of deterministic grammars
- On LR(k) grammars and languages
- The ELL(1) parser generator and the error recovery mechanism
- Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari
- Generalized overlap resolvable grammars and their parsers
- Theory of formal grammars
- Synchronous context-free grammars and optimal linear parsing strategies
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- 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
- Recursive descent parsing for Boolean grammars
- Automated generation of program translation and verification tools using annotated grammars
- Generating languages by a derivation procedure for elementary formal systems
- Predictive top-down parsing for hyperedge replacement grammars
- Transformations of grammars and translation directed by \(LR\) parsing.
- Hierarchical phrase-based translation
- On comparingLL(k) andLR(k) grammars
- Streaming algorithms for language recognition problems
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Some formal results about stratificational grammars and their relevance to linguistics
- scientific article; zbMATH DE number 60388 (Why is no real title available?)
- Semantic preserving translations
- A characterization ofLL(1) grammars
- On coupled languages and translations
- scientific article; zbMATH DE number 605141 (Why is no real title available?)
- Predictive parser combinators need four values to report errors
- On the Transformation of LL(k)-linear Grammars to LL(1)-linear
- Translation grammars for compilation and decompilation
- scientific article; zbMATH DE number 3271515 (Why is no real title available?)
- A general theory of translation
- Notes on top-down languages
- scientific article; zbMATH DE number 3309208 (Why is no real title available?)
- A note on top-down deterministic languages
- Mappings and grammars on trees
- scientific article; zbMATH DE number 3343516 (Why is no real title available?)
- A syntax-directed parser for recalcitrant grammars
- On the ambiguity and finite-valuedness problems in acceptors and transducers
- A representation theorem of infinite dimensional algebras and applications to language theory
- Abstract families of relations
- On the transformation of LL(k)-linear to LL(1)-linear grammars
- Symbolic encoding of LL(1) parsing and its applications
- Reversible Top-Down Syntax Analysis
- Producing a top-down parse order with bottom-up parsing
- \(\mathrm{LL}(k)\) cooperating distributed grammar systems
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
- On the complexity of LL(k) testing
- Reversible top-down syntax analysis
This page was built for publication: Syntax-Directed Transduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5549060)