Results 11 to 20 of about 1,902,940 (354)
Interpretation and reduction of attribute grammars [PDF]
Acta Informatica, 1983 An attribute grammar (AG) is in reduced form if in all its derivation trees every attribute contributes to the translation. We prove that, eventhough AG are generally not in reduced form, they can be reduced, i.e., put into reduced form, without ...
Filè, Gilberto
core +10 more sources
Tree automata and attribute grammars [PDF]
Information and Control, 1983 The translational mechanism of attribute grammars using tree automata are investigated. The pushdown tree-to-string transducer with a certain synchronization facility as a model to realize transformations by attribute grammars is proposed and its basic ...
Kamimura, Tsutomu
core +4 more sources
Attribute grammar evolution [PDF]
, 2005 The final publication is available at Springer via http://dx.doi.org/10.1007/11499305_19Proceedings of First International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2005, Las Palmas, Canary Islands, Spain, June ...
A.N. Chomsky +7 more
core +5 more sources
Stochastic Attribute-Value Grammars [PDF]
arXiv, 1996 Probabilistic analogues of regular and context-free grammars are well-known in computational linguistics, and currently the subject of intensive research. To date, however, no satisfactory probabilistic analogue of attribute-value grammars has been proposed: previous attempts have failed to define a correct parameter-estimation algorithm.
Abney, Steven
arxiv +5 more sources
Dynamic Attribute Grammars [PDF]
, 1996 Projet OSCARAlthough Attribuate Grammars were introduced thirty years ago, their lack of expressiveness has resulted in limited use outside the domain of static language processing.
Duris, Étienne +3 more
core +5 more sources
A Note on the Complexity of Restricted Attribute-Value Grammars
, 1995 The recognition problem for attribute-value grammars (AVGs) was shown to be undecidable by Johnson in 1988. Therefore, the general form of AVGs is of no practical use.
Torenvliet, Leen, Trautwein, Marten
core +5 more sources
Generalized Systematic Debugging for Attribute Grammars [PDF]
arXiv, 2003 Attribute grammars (AGs) are known to be a useful formalism for semantic analysis and translation. However, debugging AGs is complex owing to inherent difficulties of AGs, such as recursive grammar structure and attribute dependency. In this paper, a new systematic method of debugging AGs is proposed.
Akira Sasaki, Masataka Sassa
arxiv +3 more sources
The Automatic Inversion of Attribute Grammars [PDF]
IEEE Transactions on Software Engineering, 1984 Over the last decade there has developed an acute awareness of the need to introduce abstraction and mathematical rigor into the programming process. This increased formality allows for the automatic manipulation of software, increasing productivity and,
Mueckstein, Eva-Maria M., Yellin, Daniel
core +5 more sources
Grammar-Based Specification and Parsing of Binary File Formats
International Journal of Digital Curation, 2012 The capability to validate and view or play binary file formats, as well as to convert binary file formats to standard or current file formats, is critically important to the preservation of digital data and records. This paper describes the extension of
William Underwood
doaj +11 more sources
An attribute grammar for Ada [PDF]
ACM SIGPLAN Notices, 1982 We describe the development of a formal specification of the static semantics of Ada in form of an attribute grammar. This specification is complete, and was tested extensively with automatically generated equivalent Pascal programs. From this specification we systematically developed the semantic analysis part of our Ada Compiler Front End. We outline
Sophia Drossopoulou +5 more
openalex +3 more sources