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`

.

## Filters

##
###
Complexity characterizations of attribute grammar languages

1988
*
Information and Computation
*

ACKNOWLEDGMENTS We thank Professor George Papakonstantinou

doi:10.1016/0890-5401(88)90025-9
fatcat:gf4lyyv47zgwlm6qqgcn2vw3qm
*of*the National Technical University*of*Athens for his guidance and his insights on*attribute**grammars*. ...*grammars*, and the extension to nondeterministic*attribute**grammars*sketched at the end RECEIVED January 20, 1987; ACCEPTED November 16, 1987 ... can be generated by an*attribute**grammar*with appropriately*complex*functions and predicates defined for the productions. ...##
###
Page 3420 of Mathematical Reviews Vol. , Issue 83h
[page]

1983
*
Mathematical Reviews
*

(Russian) [Modeling and

*complexity**of*the recognition*of**languages*specified by*grammars**of*a certain class] Iipempuut 81 [Preprint 81], 5. Akad. Nauk Ukrain. SSR, Inst. ... A new type*of**grammar*is proposed.” Wilhelm, Reinhard 83h:68126 LL- and LR-*attributed**grammars*. ...##
###
Page 1126 of Mathematical Reviews Vol. , Issue 81C
[page]

1981
*
Mathematical Reviews
*

*of*

*attribute*

*grammars*[D. ... Since

*attribute*

*grammars*are mainly

*characterized*by a “syntax part”, a set

*of*“

*attributes*” for each nonterminal symbol and a set

*of*“evaluation rules”, the author gives sufficient conditions to prove ...

##
###
Page 6650 of Mathematical Reviews Vol. , Issue 90K
[page]

1990
*
Mathematical Reviews
*

This paper fo- cuses on the

*characterization**of*G-*languages*in terms*of*oo-regular*languages*. It is shown that the class*of*G-*languages*is a proper sub- class*of*the class*of*oo-regular*languages*. ... The cardinalities*of*these classes*of**languages*and operations in them are studied. The syntactic monoids*of**languages*in them are*characterized*. ...##
###
Page 261 of Mathematical Reviews Vol. , Issue 85a
[page]

1985
*
Mathematical Reviews
*

Nielson, Hanne Riis (4-EDIN) 85a:68105 Computation sequences: a way to

*characterize*classes*of**attribute**grammars*. Acta Inform. 19 (1983), no. 3, 255-268. ... By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple*characterizations**of*well-known subclasses*of**attribute**grammars*. ...##
###
Commentary: Developmental Constraints on Learning Artificial Grammars with Fixed, Flexible, and Free Word Order

2018
*
Frontiers in Psychology
*

The authors

doi:10.3389/fpsyg.2018.00276
pmid:29569645
pmcid:PMC5845589
fatcat:n6g5pwgmdvdzjjgef4nxefry3m
*attribute*these results to the inability*of*children to acquire typologically implausible*grammars*, suggesting that adults either have distinct constraints on*language*learning, or are able ... Here, I show that the contrasts in Nowak and Baggio (2017) can be explained by*language*-theoretical*characterizations**of*the stimuli, in line with a relatively recent research program focused on studying ... The authors*attribute*these results to the inability*of*children to acquire typologically implausible*grammars*, suggesting that adults either have distinct constraints on*language*learning, or are able ...##
###
Page 3372 of Mathematical Reviews Vol. , Issue 91F
[page]

1991
*
Mathematical Reviews
*

Summary: “We

*characterize*precisely the power*of**attribute*gram- mars when all functions are identities (such*attribute**grammars*are known to simulate functionless logic programs). ... A*characterization**of*the LC(0)*languages*is given in terms*of*the simple deterministic*languages*and these classes*of**languages*are compared with other classes*of**languages*, such as the LL(1)*languages*...##
###
Page 1884 of Mathematical Reviews Vol. 55, Issue 6
[page]

1978
*
Mathematical Reviews
*

An algorithm is described to determine, given the

*attribute**grammar*, how many passes from left to right are necessary for the evaluation*of**attributes*. ...*Attribute**grammars*in the sense*of*Knuth are considered. A condition for such a*grammar*is given which assures that semantic*attributes*can be evaluated in a single pass over the derivation tree. ...##
###
Page 3875 of Mathematical Reviews Vol. , Issue 83i
[page]

1983
*
Mathematical Reviews
*

That is to say, any

*attribute**grammar*can be expressed as a set*of*equations in the Scott- Strachey style. ... Furthermore, properties*of**attribute**grammars*are pointed out which reflect in a simplification*of*both the compiler for the*language*being defined and the corresponding set*of*(denotational) semantics ...##
###
Page 5688 of Mathematical Reviews Vol. , Issue 93j
[page]

1993
*
Mathematical Reviews
*

Using these

*characterizations*, we estimate the*complexity**of**languages*generated by these LFGs.” ... We prove that the*languages*generated by them have a nonempty intersection with the class*of*context-free*languages*.” 93j:68111 68Q50 Nishino, Tetsuro (J-TDU-I) Relating*attribute**grammars*and lexical-functional ...##
###
Page 4901 of Mathematical Reviews Vol. , Issue 82k
[page]

1982
*
Mathematical Reviews
*

It is shown that the problem

*of*determining whether an arbitrary*attribute**grammar*is pure multipass, is*of*inherently exponential time*complexity*. ... Nevertheless, in this article we consider only context-free atomary*grammars*and*languages*.” 8268047 Reutenauer, Christophe 82k:68045 A new*characterization**of*the regular*languages*. ...##
###
Page 2133 of Mathematical Reviews Vol. , Issue 83e
[page]

1983
*
Mathematical Reviews
*

Authors’ summary: “We

*characterize*the images*of*Szilard*languages*under decreasing homomorphisms using so-called label*grammars*and show that each A-free label*language*is in fact the coding*of*some Szilard ... Fiilép, Z. 83e:68102 On*attributed*tree transducers. Acta Cybernet. 5 (1980/81), no. 3, 261-279. Author’s introduction: “The concept*of**attribute**grammar*was introduced by D. E. Knuth [Math. ...##
###
Page 5480 of Mathematical Reviews Vol. , Issue 2003g
[page]

2003
*
Mathematical Reviews
*

form), (b) the con- struction

*of**grammars*for so-called 2-block*languages*, and (c) a method for*characterizing*the radius*of*convergence*of*formal power series with nonnegative coefficients that satisfy ... “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*...##
###
Page 984 of Mathematical Reviews Vol. , Issue 87b
[page]

1987
*
Mathematical Reviews
*

Engelfriet, Joost (NL-LEID-C) 87b:68059 The

*complexity**of**languages*generated by*attribute**grammars*. SIAM J. Comput. 15 (1986), no. 1, 70-86. ...*of*index*grammars*as a means*of*descrip- tion*of*programming*languages*. ...##
###
Page 1997 of Mathematical Reviews Vol. , Issue 84e
[page]

1984
*
Mathematical Reviews
*

Control 6 (1963), 246-264; MR 29
#1109] which says that, given a context-free

*grammar*, the generated*language*may be*characterized*as the least fixpoint*of*an appropriate function. ... {Japanese original: Denshi Tsushin Gakkai Ronbunshi D 64 (1981), no. 5, 419-426. } Alblas, Henk A*characterization**of**attribute*evaluation in passes. Acta Inform. 16 (1981), no. 4, 427-464. ...
« Previous

*Showing results 1 — 15 out of 47,511 results*