35 search results - page 1 / 7 » Practical Experiments with Regular Approximation of Context-... |
APLAS
2006
ACM
13 years 10 months ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
DLT
2009
13 years 2 months ago
2009
Abstract. We consider algorithms for approximating context
WIA
2007
Springer
13 years 11 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
COLING
2000
13 years 4 months ago
2000
COLING
2002
13 years 4 months ago
2002
We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side...