Sciweavers

77 search results - page 6 / 16
» Formal properties of XML grammars and languages
Sort
View
LDTA
2010
13 years 7 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
DOCENG
2003
ACM
14 years 19 days ago
Automating XML document structure transformations
This paper describes an implementation for syntax-directed transformation of XML documents from one structure to another. The system is based on the method which we have introduce...
Paula Leinonen
PASTE
2010
ACM
13 years 9 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
SAS
1991
Springer
13 years 11 months ago
On Static Properties of Specialized Programs
Specializing programs by partial evaluation is well defined extensionally, but in practice no intensional properties, such as what the specialized programs will look like or how ...
Karoline Malmkjær
ESSLLI
1999
Springer
13 years 11 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann