Semantics of context-free languages: Correction
From MaRDI portal
Publication:5624673
DOI10.1007/BF01702865zbMath0219.68035OpenAlexW165164194WikidataQ56672531 ScholiaQ56672531MaRDI QIDQ5624673
Publication date: 1971
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01702865
Related Items
Pushdown machines for the macro tree transducer ⋮ Algebraic dynamic programming for multiple context-free grammars ⋮ Classical and incremental attribute evaluation by means of recursive procedures ⋮ Composition and evaluation of attribute coupled grammars ⋮ On the distribution of the leading digit of \(a^n\): a study via \(\chi^2\) statistics ⋮ Final algebra semantics and data type extensions ⋮ A characterization of the squares in a Fibonacci string ⋮ Enumerating grammar-based extractions ⋮ Characterizing attributed tree translations in terms of macro tree transducers ⋮ Sémantique du parallélisme et du choix du langage Electre ⋮ Optimal incremental simple multi-pass attribute evaluation ⋮ A semantic extension of BNF ⋮ Testing attribute grammars for circularity ⋮ Attribute grammars and recursive program schemes. I. II ⋮ A survey of state vectors ⋮ On the roles of semantic locality of crossover in genetic programming ⋮ Geometrical aspects of expansions in complex bases ⋮ A survey of strategies in rule-based program transformation systems ⋮ On efficient implementation of LR-attributed grammars ⋮ An efficient semantic evaluator for warped LC(1) attributed grammars ⋮ A linked forest manipulation system syntax rules for an attributed translation grammar for PL/0 ⋮ Operational semantics of a kernel of the language ELECTRE ⋮ Relating attribute grammars and lexical-functional grammars ⋮ Proof methods of declarative properties of definite programs ⋮ Tree transducers with external functions ⋮ Simulation studies of the power of birnbaum's test ⋮ Composing stack-attributed tree transducers ⋮ Simple multi-visit attribute grammars ⋮ An optimization of the alternating semantic evaluator ⋮ Deterministic representation of probabilistic systems by ergodic machines ⋮ Loops and Overloops for Tree Walking Automata ⋮ Document Spanners ⋮ Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials ⋮ Ordered attributed grammars ⋮ An order-algebraic definition of knuthian semantics ⋮ Realization of attributive semantics ⋮ Global storage cells for attributes in an attribute grammar ⋮ ECLR-attributed grammars: a practical class of LR-attributed grammars ⋮ Attributed tree grammars ⋮ The simple pendulum and the periodic LQG control problem ⋮ Comonadic Notions of Computation ⋮ Stochastic recurrences of Jackpot Keno. ⋮ Macro tree transducers
