Sciweavers

18 search results - page 1 / 4
» XML Validation for Context-Free Grammars
Sort
View
APLAS
2006
ACM
13 years 11 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
FOSSACS
2007
Springer
13 years 12 months ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide
CPP
2011
107views more  CPP 2011»
12 years 5 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
CL
2000
Springer
13 years 5 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
ICWS
2008
IEEE
13 years 7 months ago
High-Performance XML Parsing and Validation with Permutation Phrase Grammar Parsers
The extensibility, flexibility, expressiveness, and platform-neutrality of XML delivers key advantages for interoperability. The interoperability of XML Web services often comes a...
Wei Zhang, Robert A. van Engelen