Results 261 to 270 of about 432,601 (300)
Some of the next articles are maybe not open access.
Poverty of the Stimulus Revisited
Cognitive Sciences, 2011A central goal of modern generative grammar has been to discover invariant properties of human languages that reflect "the innate schematism of mind that is applied to the data of experience" and that "might reasonably be attributed to the organism ...
R. Berwick +3 more
semanticscholar +1 more source
Introduction to attribute grammars
1991This paper recalls the definition of attribute grammars. To give a first impression of the applicability and the power of attribute grammars two examples are given which describe the type-determination problem for simple arithmetic expressions. Also, Knuth's circularity test for attribute grammars is described.
openaire +3 more sources
Software: Practice and Experience, 1993
AbstractContrary to a widely‐held belief, it is possible to construct executable specifications of language processors that use a top‐down parsing strategy and which have structures that directly reflect the structure of grammars containing left‐recursive productions.
openaire +2 more sources
AbstractContrary to a widely‐held belief, it is possible to construct executable specifications of language processors that use a top‐down parsing strategy and which have structures that directly reflect the structure of grammars containing left‐recursive productions.
openaire +2 more sources
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
Verification of attribute grammar
Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81, 1981Verification of attribute grammar is discussed. As is widely recognized, attribute grammar of Knuth [8] is a very convenient device to describe semantics of programming languages, especially in automating compiler construction. Many efforts have been made to obtain efficient evaluators for attribute grammar [1,3,4,5,7,10] so that efficient compilers ...
Takuya Katayama, Yutaka Hoshino
openaire +2 more sources
Use of attributed grammars for pattern recognition of evoked potentials
IEEE Transactions on Systems, Man and Cybernetics, 1988A pattern recognition system for classifying brain-stem auditory evoked potential is described. A string of terminal symbols, as a formal representation of the evoked potential waveform, is processed by a regular attributed grammar.
I. Bruha, G. Madhavan
semanticscholar +1 more source
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
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