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 application/pdf.
Filters
Coupling evaluators for attribute coupled grammars
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
For this purpose we have introduced the notion of coupling evaluator. ...
., it produces an attribute grammar which speci es the composition of two attribute coupled grammars. We introduce a new approach to this composition of attribute coupled grammars. ...
To introduce our coupling evaluators, we rst recall the de nition of attribute grammars where the attributes are typed by sorts. De nition2 (Attribute Grammar). ...
doi:10.1007/3-540-57877-3_4
fatcat:rzo6gdojyzbkxpw4voaizenu3i
Automatic generation of near-optimal linear-time translators for non-circular attribute grammars
1979
Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79
Preserved Fulltext
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 application/pdf.
Attribute grammars are an extension of contextfree grammars devised by Knuth as a formalism for specifying the semantics of a context-free ...
In [Wa] Warren introduced a general model for deterministic evaluation of attribute grammars, called the "coroutine evaluator", and developed general methods for constructing such evaluators. ...
An algorithm which accepts as input~semantic tree generated by a given attribute' grammar G and evaluates it is called a translator(or evaluator) for G. ...
doi:10.1145/567752.567764
dblp:conf/popl/CohenH79
fatcat:aars4ah2mrhb5awjyqkif36c4y
Composing tree attributions
1994
Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94
Preserved Fulltext
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 application/pdf.
Using the simple tree attributions described in this paper, attribute values cmthemselves be trees, enabling ...
Acknowledgements We thank Robert Giegerich for sharing hk insights with us and for his suggested improvements to the paper.
The comments of David Bacon and William Maddox were also most valuable. ...
Syntactic
attributes
are used for the second purpose
in attribute
coupled grammars.
Composable
attribute
grammars use syntactic attributes
for both purposes. ...
doi:10.1145/174675.177971
dblp:conf/popl/BoylandG94
fatcat:ifgaxiguifhb5hnwk3zfdhsiem
'Focusing and Unfocusing'—Cognitive, Evaluative, and Emotional Dynamics in the Relationship with Human Embryos among ART Beneficiaries
2022
Societies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
dimensions in beneficiaries' relationship with—and decision-making processes about—the embryos, accounting for the plasticity of emotional states linked to the (re)configuration of attributed meanings. ...
ART beneficiaries are likely to produce plural conceptions of the lab-generated embryo within the framework of different regimes of engagement, understood as cognitive and evaluative formats. ...
This interviewee's discourse, when discussing a previous failed treatment cycle, also reveals the particular importance they attribute to devices for biomedically evaluating the embryos in prompting changes ...
doi:10.3390/soc12010007
fatcat:inkd2fccmzbftna32bn7aibnhi
Embedding domain specific languages in the attribute grammar formalism
2003
36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
This paper presents techniques for the design and implementation of domain specific languages. Our techniques are based on higher-order attribute grammars. ...
Formal languages are specified in the classical attribute formalism and domain specific languages are embedded in the specification via higher-order attributes. ...
Grammars are coupled/glued by defining attribute equations that build the required tree-valued attributes. ...
doi:10.1109/hicss.2003.1174889
dblp:conf/hicss/SaraivaS03
fatcat:gb2zdcqmfrbfrhqxd3akkbhuue
Page 5480 of Mathematical Reviews Vol. , Issue 2003g
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
“There are several kinds of attribute grammars, such as cir- cular attribute grammars, multi-attribute grammars, conditional attribute grammars, higher-order attribute grammars, couple at- tribute grammars ...
“Each has its own algorithm for evaluation. In addition, incre- mental techniques have been devised for the re-evaluation of these attributes. ...
Modeling and predicting all-α transmembrane proteins including helix–helix pairing
2005
Theoretical Computer Science
Preserved Fulltext
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 application/pdf.
We show in this paper that alltransmembrane protein secondary and super-secondary structures can be modeled with a multi-tape S-attributed grammar. ...
An efficient structure prediction algorithm using both local and global constraints is designed and evaluated. ...
Acknowledgements We thank Francois André, from the CEA-Saclay (France), for his helpful remarks and instructions during the biological evaluation of the model. ...
doi:10.1016/j.tcs.2004.12.018
fatcat:uddqequarrglhaglkjw7iuozmi
Peter W. Culicover & Andrzej Nowak, Dynamical grammar: minimalism, acquisition and change (Foundations of Syntax 2 ). Oxford: Oxford University Press, 2003. Pp. xxii+324
2006
Journal of Linguistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Dynamical grammar is the second part of a two-volume work entitled ' Foundations of Syntax '. ...
syntactic theory, and language acquisition (Culicover 1999), investigated the properties of language itself, with the aim of establishing the boundary conditions on the learning mechanisms responsible for ...
For example, when the string tall man is coupled with the meaning MAN(TALL), this causes tall man to be reduced to man. ...
doi:10.1017/s0022226706234091
fatcat:k2eel7fpz5dwdllrtj4zrq4izq
Another kind of modular attribute grammars
[chapter]
1992
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The decomposition of attribute grammars into modules is investigated. In our approach the alternative rules of a nonterminal may be separated into different modules. ...
The set of already implemented modules can be reused for new applications. A short explanation of these ideas within the system FLR is given. ...
For the grammars G1 and G2 an attribute coupling is defined as a mapping between the term algebra of G1 into the term algebra of G2. ...
doi:10.1007/3-540-55984-1_5
fatcat:zxi3v6daezethgtvpaqfycaqki
Attribute grammars as a functional programming paradigm
[chapter]
1987
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Firstly we show how attributes in an attribute grammar can be simply and efficiently evaluated using a lazy functional language. ...
We show how such efficient but tangled programs can have natural formulations as attribute grammars. ...
Coupled with a simple and efficient method for attribute evaluation, based on lazy evaluation, we can also obtain efficient programs. ...
doi:10.1007/3-540-18317-5_10
fatcat:tx4kdhkopjdrrmgq3oifxpej6u
Causal Discovery using Compression-Complexity Measures
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present a framework which relies on lossless compressors for inferring context-free grammars (CFGs) from sequence pairs and quantifies the extent to which the grammar inferred from one sequence compresses ...
We evaluate these models on synthetic and real-world benchmarks and empirically observe performances competitive with current state-of-the-art methods. ...
We attribute this performance to effective inference of unique context-free grammars (CFGs) by ETC from input symbolic sequences. ...
arXiv:2010.09336v2
fatcat:wkhwlaas7fc6le5wwcqdrbjn4a
Syntactic pattern recognition of the ECG
1990
IEEE Transactions on Pattern Analysis and Machine Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Attribute grammars are used as the model for the pattern grammar because of their descriptive power, which is due to their ability to handle syntactic as well as semantic information. ...
This approach has been implemented and the performance of the resultant system has been evaluated using an annotated standard ECG library. ; I T U segment r +--- ...
Papakonstantinou for having made available to us an implementation of Floyd's parser. ...
doi:10.1109/34.56207
fatcat:3iya2osmyvbcvg5j55z4todjxi
Implementation of a Modelica compiler using JastAdd attribute grammars
2010
Science of Computer Programming
Preserved Fulltext
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 application/pdf.
To achieve extensibility, the implementation is done declaratively in JastAdd, a metacompilation system supporting modern attribute grammar mechanisms such as reference attributes and nonterminal attributes ...
For name and type analyses, we illustrate how declarative design strategies, originally developed for a Java compiler, could be reused to support Modelica's advanced features of multiple inheritance and ...
Attribute evaluation is implicit: when accessing an attribute (by calling its method), the attribute is automatically evaluated. ...
doi:10.1016/j.scico.2009.07.003
fatcat:2exskfbn2jgitociuzgy5ifntq
Composable attribute grammars
1992
Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92
Preserved Fulltext
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 application/pdf.
Acknowledgement We thank John Field and Roger Hoover for reading a preliminary version of this paper and suggesting improvements for its presentation. ...
Of those, this work is most closely related to Attribute
Coupled Grammars [12, 13], Cascaded Evaluation
[10],
Higher-order
Attribute
Grammars
[25], and Modular
Attribute
Grammars
[6]. ...
Attribute
Coupled Grammars
decompose complex
translations
into a sequence of steps, each of which
(conceptually)
constructs parse trees for the next step
via syntactic attributes
and rules. ...
doi:10.1145/143165.143210
dblp:conf/popl/FarrowMY92
fatcat:jiu3rht7uvesxggzg7rjmrbuxm
Efficient GCD functions in SQL
2013
Proceedings of the 8th conference of the European Society for Fuzzy Logic and Technology
Preserved Fulltext
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 application/pdf.
Now that we have defined a grammar for our custom GCD query we can describe our transformation. ...
The LSP soft computing technique is used for multi-criteria decision support and allows evaluating a system during all phases of its lifecycle. ...
doi:10.2991/eusflat.2013.99
dblp:conf/eusflat/NielandtBT13
fatcat:ttdcjgphujcv7oc6zj7qeroefa
« Previous
Showing results 1 — 15 out of 29,528 results