Sciweavers

35 search results - page 1 / 7
» Practical Experiments with Regular Approximation of Context-...
Sort
View
APLAS
2006
ACM
13 years 10 months ago
XML Validation for Context-Free Grammars
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...
Yasuhiko Minamide, Akihiko Tozawa
DLT
2009
13 years 2 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu
WIA
2007
Springer
13 years 10 months ago
Analyzing Ambiguity of Context-Free Grammars
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...
Claus Brabrand, Robert Giegerich, Anders Mø...
COLING
2002
13 years 4 months ago
A Novel Disambiguation Method for Unification-Based Grammars Using Probabilistic Context-Free Approximations
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...
Bernd Kiefer, Hans-Ulrich Krieger, Detlef Prescher