A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
The grammars are proposed for language specifications in reference manuals and for the automatic generation of practical compiler modules. ... Research in progress is reported regarding a variation on attribute and affix grammars intended for describing the "static semantic" or "context-sensitive syntactic" constraints on programming languages ... The general idea of tree-affix dendrogrammars (TADGs) Underlying dendrogrammar. The general idea has already been given away in the introduction. ...doi:10.1007/3-540-10250-7_26 fatcat:qbjxzlw6gnf7vpal3cezorznqu
Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. ... The context-free S languages can be obtained from the deterministic one-way S automaton languages by way of the delta operations on languages, introduced in this paper. ... Watt; The parsing problem for aﬃx grammars, Acta Informatica 8 (1977), 1–20. [Wat2] D. A. Watt; Contextual constraints, in: Methods and Tools for Compiler Construction (ed. B. ...arXiv:1408.0683v1 fatcat:sr2by746tvfenjsotqqop67v2a