|
COmputer Language Manipulation |
A transformation language has a type system based on formal languages. Rather than define classes or data structures, one defines grammars. A parser is constructed automatically from the grammar and it is used for two purposes: to parse the input language and to parse the structural patterns in the program that performs the analysis. In this setting grammar-based parsing is critical because it guarantees that both the input and the structural patterns are parsed into trees from the same set of types, allowing comparison.
Colm's main contribution lies in the parsing method. Colm's parsing engine is generalized, but it also allows for the construction of arbitrary global data structures that can be queried during parsing. In other generalized methods construction of global data requires some very careful consideration because of inherent concurrency in the parsing method. It is such a tricky task that it is often avoided altogether and the problem is deferred to a post-parse disambiguation of the parse forest.
Using Colm it is possible to get the correct parse tree on the first pass. Colm eliminates the need to reason about concurrent updates to global data or to acquire many possible parse trees only to throw away the incorrect ones.
http://svn.complang.org/colm/trunk/