5 search results - page 1 / 1 » Operator precedence for data-dependent grammars |
CORR
2010
Springer
13 years 1 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
CL
2000
Springer
13 years 4 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 5 months ago
2010
In this paper we present a partial dependency parser for Irish, in which Constraint Grammar (CG) rules are used to annotate dependency relations and grammatical functions in unres...
DSL
2009
13 years 2 months ago
2009
Abstract. Both XML and Lisp have demonstrated the utility of generic syntax for expressing tree-structured data. But generic languages do not provide the syntactic richness of cust...
ISSTA
2009
ACM
13 years 10 months ago
2009
ACM
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including securityrelevant ones. However, existing symbolic execution...