A dependency parser analyzes the grammatical structure of a sentence, establishing relationships between "head" words and words which modify those heads.
EXTENSIBLE PARSING & TRANSFORMATION We present the metafront tool for specifying flexible, safe, and efficient syntactic transformations between languages defined by context-free grammars. The transformations are guaranteed to terminate and to map grammatically legal input to grammatically legal output. We rely on a novel parser algorithm, specificity parsing, that is designed to support gradual extensions of a grammar by allowing productions to remain in a natural style and by statically reporting ambiguities and errors in terms of individual productions as they are being added. Our tool may be used as a parser generator in which the resulting parser automatically supports a flexible, safe, and efficient macro processor, or as an extensible lightweight compiler generator for domain-specific languages. We show substantial examples of both kinds.
A grammar for Haskell, close to the specification in the Haskell report is given. This is especially interesting, as many rules given in the report are hard to implement.
Treetop is a language for describing languages. Combining the elegance of Ruby with cutting-edge parsing expression grammars, it helps you analyze syntax with revolutionarily ease.
The ANTLR 3 Eclipse Plugin helps you develop ANTLR 3 grammars inside Eclipse. It currently provides a project nature, a label decorator, a builder, and problem markers for ANTLR errors.
B. Plank, and G. van Noord. Proceedings of the 2010 Workshop on NLP and Linguistics: Finding the Common Ground, page 25--33. Stroudsburg, PA, USA, Association for Computational Linguistics, (2010)
R. Kern, M. Muhr, and M. Granitzer. Proceedings of the 5th International Workshop on Semantic Evaluation, page 351--354. Stroudsburg, PA, USA, Association for Computational Linguistics, (2010)