Results 221 to 230 of about 1,546 (250)
A novel binary hashing for agricultural scenery classification. [PDF]
Sci RepWang H, Liu JH, Yang Y.
europepmc +1 more source
Practical Attribute Grammar Forms Allowing Continuations
, 1986 Hiroyuki Matsuda
openalex +1 more source
Typing Haskell with an Attribute Grammar (Part I)
, 2004 Atze Dijkstra, S. Doaitse Swierstra
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ECLR-attributed grammars: A practical class of LR-attributed grammars
Information Processing Letters, 1987A class of attribute grammars called LR-attributed grammars (LR-AGs) has been proposed by Jones and Madsen as a (virtually) maximum class for which attributes can be evaluated in a single pass during LR parsing, without constructing a syntax tree. However, the original definition of LR-AGs has the problem that evaluation of attributes is inefficient in
Sassa, M., Ishizuka, H., Nakata, I.
openaire +1 more source
ACM SIGPLAN Notices, 1984
In this paper, attribute grammars are viewed as specifying translations from source language terms into target language terms. The terms are constructed over a hierarchical signature consisting of a semantic and a syntactic part. Attribute grammars are redefined to become morphisms in the category of such signatures, called attribute coupled grammars ...
Harald Ganzinger, Robert Giegerich
openaire +1 more source
In this paper, attribute grammars are viewed as specifying translations from source language terms into target language terms. The terms are constructed over a hierarchical signature consisting of a semantic and a syntactic part. Attribute grammars are redefined to become morphisms in the category of such signatures, called attribute coupled grammars ...
Harald Ganzinger, Robert Giegerich
openaire +1 more source
Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92, 1992
This paper introduces Composable Attribute Grammars (CAGs), a formalism that extends classical attribute grammars to allow for the modular composition of translation specifications and of translators. CAGs bring to complex translator writing systems the same benefits of modularity found in modern programming languages, including comprehensibility ...
R. Farrow, T. J. Marlowe, D. M. Yellin
openaire +1 more source
This paper introduces Composable Attribute Grammars (CAGs), a formalism that extends classical attribute grammars to allow for the modular composition of translation specifications and of translators. CAGs bring to complex translator writing systems the same benefits of modularity found in modern programming languages, including comprehensibility ...
R. Farrow, T. J. Marlowe, D. M. Yellin
openaire +1 more source
ACM SIGPLAN Notices, 1992
It is widely believed that top down parsing is incompatible with left recursive grammars. We show that this is not true. We describe a novel device by which left recursive productions can be directly compiled into executable interpreters that use a top down parsing strategy.
openaire +1 more source
It is widely believed that top down parsing is incompatible with left recursive grammars. We show that this is not true. We describe a novel device by which left recursive productions can be directly compiled into executable interpreters that use a top down parsing strategy.
openaire +1 more source