Results 191 to 200 of about 9,368 (204)
An attribute grammar view [PDF]
, 1994 Controlled M-grammars, defined formally in Chapter 17, are essentially different from M-grammars without control. The set of well-formed derivation trees is defined at two levels instead of one. The control expressions define a superset of this set of derivation trees, and M-rule applications filter out the ill-formed ones from this superset.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of the ACM, 2005
Describing the static semantics of programming languages with attribute grammars is eased when the formalism allows direct dependencies to be induced between rules for nodes arbitrarily far away in the tree. Such direct non-local dependencies cannot be analyzed using classical methods, which enable efficient ...
openaire +2 more sources
Describing the static semantics of programming languages with attribute grammars is eased when the formalism allows direct dependencies to be induced between rules for nodes arbitrarily far away in the tree. Such direct non-local dependencies cannot be analyzed using classical methods, which enable efficient ...
openaire +2 more sources
Finding circular attributes in attribute grammars
Journal of the ACM, 1999The problem of finding the circular attributes in an grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially expontial. It is also shown that finding the circular attributes is harder than testing circularity.
Michael Rodeh, Mooly Sagiv
openaire +2 more sources
Attribute grammars made easier: EvDebugger a visual debugger for attribute grammars
2014 International Symposium on Computers in Education (SIIE), 2014Compiler construction courses are usually considered by the students as a difficult subject of the Computer Science degree. The main problem found by the students is to fully understand the theoretical concepts taught during the course and its practical application to build a compiler.
Daniel Rodriguez-Cerezo +2 more
openaire +2 more sources
Stepwise evaluation of attribute grammars
Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications, 2011Attribute Grammars are a powerful formalism to specify and implement the semantics of programming languages (e.g. as in a compiler), in particular when the semantics are syntax directed. Advanced type systems, however, use nondeterminism in their specifications to encode decisions that are independent of syntax.
S. Doaitse Swierstra +2 more
openaire +3 more sources
Attribute Grammars and Analysis
2011In the Chapter 7, we concentrated on the discussion of parsing methods, i.e. the top-down and bottom-up syntactical methods, especially LL(1) and LR(1) syntactical analysis methods. From the discussion, we can see that in order to carry out LL(1) or LR(1) syntactical analysis there is a need for the premise that the grammar to be analyzed is a context ...
Yunlin Su, Song Y. Yan
openaire +2 more sources
Conditional attribute grammars
ACM Transactions on Programming Languages and Systems, 1996Attribute grammars are a useful formalism for the specification of computations on structured terms. The classical definition of attribute grammars, however, has no way of treating conditionals nonstrictly. Consequently, the natural way of expressing many otherwise well-behaved computations involves a circularity. This article presents
openaire +2 more sources
BIT, 1990
Evaluation of inherited attributes is a problem in conjunction with LR parsing, because the derivation tree is incomplete during parsing. An evaluation scheme for inherited attributes is presented based on a restricted grammar class, uncle-attributed grammars. A transformation to the uncle-attributed form is described for L-attributed grammars.
openaire +2 more sources
Evaluation of inherited attributes is a problem in conjunction with LR parsing, because the derivation tree is incomplete during parsing. An evaluation scheme for inherited attributes is presented based on a restricted grammar class, uncle-attributed grammars. A transformation to the uncle-attributed form is described for L-attributed grammars.
openaire +2 more sources
On attribute grammars without attribute synthesis
Information Processing Letters, 1990Abstract We characterize precisely the power of attribute grammars when all functions are identities (such attribute grammars are known to simulate functionless logic programs). In the general case, the problem of deciding whether a given grammar generates a given string is complete for exponential time.
openaire +1 more source
Attribute grammars in the functional style
1998For a long time, attribute grammars have formed an isolated programming formalism. We show how we may embed the attribute grammar approach in a modern functional programming language. The advantages of both sides reinforce each other: the former provides compositionality and the latter naming abstraction and higher-orderness.
P. R. Azero, S. D. Swierstra
openaire +3 more sources