1242 search results - page 33 / 249 » The Theory of Grammar Constraints |
HASE
2008
IEEE
14 years 1 months ago
2008
IEEE
A high assurance system requires both functional and nonfunctional correctness before the system is put into operation. To examine whether a system’s actual performance complies...
LATA
2010
Springer
14 years 1 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
COLING
1996
13 years 8 months ago
1996
Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the le...
EACL
2003
ACL Anthology
13 years 8 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...