Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Obtaining practical variants of LL (K) and LR (K) for K greater than 1 by splitting the atomic K-tuple
ANTLR: a predicated-LL(k) parser generator
Software—Practice & Experience
Algebraic processing of programming languages
AMiLP '95 Proceedings of the first international AMAST workshop on Algebraic methods in language processing
Reversible Grammar in Natural Language Processing
Reversible Grammar in Natural Language Processing
A symmetrical approach to parsing and generation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Generation as structure driven derivation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Semantic similarity based ontology cache
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
| Hi-index | 0.00 |
It is difficult to serialize an RDF graph as a humanly readable RDF/XML document. This paper describes the approach taken in Jena 1.2, in which a design pattern of guarded procedures invoked using top down recursive descent is used. Each procedure corresponds to a grammar rule; the guard makes the choice about the applicability of the production. This approach is seen to correspond closely to the design of an LL(k) parser, and a theoretical justification of this correspondence is found in universal algebra.