IANDC
2008
13 years 11 months ago
2008
Abstract. Boolean grammars are an extension of context-free grammars, in which all propositional connectives are allowed. In this paper, the notion of ambiguity in Boolean grammars...
ACTA
2007
13 years 11 months ago
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
CSL
2010
Springer
14 years 19 days ago
2010
Springer
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...
ACL
1996
14 years 25 days ago
1996
This paper proposes the use of "patternbased" context-free grammars as a basis for building machine translation (MT) systems, which are now being adopted as personal too...
ACL
1993
14 years 25 days ago
1993
This paper introduces a tree generating system called Lexicalized Context-Free Grammar (LCFG) and describes a cubic-time parser for it. LCFG embeds the elegance of the analyses fo...
ACL
1998
14 years 26 days ago
1998
We present a new LR algorithm for treeadjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpl...
DLT
2006
14 years 28 days ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
DAGSTUHL
2006
14 years 28 days ago
2006
Abstract. The talk focused on a grammar-based technique for identifying redundancy in program code and taking advantage of that redundancy to reduce the memory required to store an...
MLMTA
2007
14 years 28 days ago
2007
- While grammar inference (or grammar induction) has found extensive application in the areas of robotics, computational biology, speech and pattern recognition, its application to...
CP
2006
Springer
14 years 3 months ago
2006
Springer
Abstract. By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated...