15 search results - page 3 / 3 » Context-Free Grammars with Linked Nonterminals |
CL
2000
Springer
13 years 6 months ago
2000
Springer
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
LREC
2010
13 years 7 months ago
2010
We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag...
LATA
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
COLING
2008
13 years 7 months ago
2008
We generalize Uno and Yagiura's algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the tw...
KBSE
2007
IEEE
14 years 15 days ago
2007
IEEE
We present CESE, a tool that combines exhaustive enumeration of test inputs from a structured domain with symbolic execution driven test generation. We target programs whose valid...