Coco/R is a compiler generator, which takes an attributed grammar of a source language and generates a scanner and a parser for this language. The scanner works as a deterministic finite automaton. The parser uses recursive descent. LL(1) conflicts can be resolved by a multi-symbol lookahead or by semantic checks. Thus the class of accepted grammars is LL(k) for an arbitrary k.
A compiler to translate regular expressions (regular grammars) and LL1 BNF languages (subset of context free grammars) to generated scanners and/or parsers.
C# Visual Studio T4 template processing for compiling regular expressions into code for ultra fast execution of several parallel regular expressions. This project is inspired by the re2c regular expression compiler.
The implementation of the PAMOJA component framework, providing a coherent set of lightweight components for Grammar-Aware Engineering (GAE) in an Integrated Development Environment (IDE) such as Eclipse and NetBeans. In particular, PAMOJA includes components that deal with transformation of language terms from concrete textual form to abstract syntax trees (ASTs) and the converse transformation from abstract to concrete.
