The following pages link to Syntax-Directed Transduction (Q5549060):
Displaying 50 items.
- Generating languages by a derivation procedure for elementary formal systems (Q294648) (← links)
- Streaming algorithms for language recognition problems (Q391078) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- A representation theorem of infinite dimensional algebras and applications to language theory (Q579947) (← links)
- Producing a top-down parse order with bottom-up parsing (Q672970) (← links)
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata (Q736618) (← links)
- On the complexity of LL(k) testing (Q794445) (← links)
- Reversible top-down syntax analysis (Q832945) (← links)
- Parallel parsing on the connection machine (Q1121034) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- PHRASE parsers from multi-axiom grammars (Q1129132) (← links)
- A method for transforming grammars into LL(k) form (Q1134533) (← links)
- Programming language ALGOL 68 (Q1140980) (← links)
- Two iteration theorems for the LL(k) languages (Q1148695) (← links)
- Interdependent translation schemes (Q1151758) (← links)
- Translations on a subclass of LR(k) grammars (Q1166940) (← links)
- On the relationship between the LL(k) and LR(k) grammars (Q1167546) (← links)
- Efficient parsing algorithms for general context-free parsers (Q1215404) (← links)
- Are two context-free languages translatable in a syntax-directed translation scheme? (Q1217456) (← links)
- Attributed translations (Q1218732) (← links)
- LL-regular grammars (Q1220793) (← links)
- Normal forms of deterministic grammars (Q1238425) (← links)
- On LR(k) grammars and languages (Q1239009) (← links)
- The ELL(1) parser generator and the error recovery mechanism (Q1243137) (← links)
- Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari (Q1249415) (← links)
- Generalized overlap resolvable grammars and their parsers (Q1393941) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Synchronous context-free grammars and optimal linear parsing strategies (Q2353407) (← links)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
- Properties of syntax directed translations (Q2532395) (← links)
- Syntax directed translations and the pushdown assembler (Q2535241) (← links)
- Generalized sequential machine maps (Q2540272) (← links)
- LR(k) grammars and deterministic languages (Q2549581) (← links)
- Pair grammars, graph languages and string-to-graph translations (Q2550295) (← links)
- Top-down syntax nalysis (Q2551318) (← links)
- Efficient LR(1) parsers (Q2552024) (← links)
- Generation, recognition and parsing of context-free languages by means of recursive graphs (Q2559926) (← links)
- Recursive descent parsing for Boolean grammars (Q2641876) (← links)
- Automated generation of program translation and verification tools using annotated grammars (Q2653929) (← links)
- Predictive Top-Down Parsing for Hyperedge Replacement Grammars (Q2947208) (← links)
- (Q3143771) (← links)
- Hierarchical Phrase-Based Translation (Q3225461) (← links)
- On comparingLL(k) andLR(k) grammars (Q3878763) (← links)
- Some formal results about stratificational grammars and their relevance to linguistics (Q3968471) (← links)
- (Q4008193) (← links)
- Semantic preserving translations (Q4061931) (← links)
- A characterization ofLL(1) grammars (Q4109317) (← links)
- On coupled languages and translations (Q4131693) (← links)
- (Q4300061) (← links)
- Predictive parser combinators need four values to report errors (Q4895557) (← links)
