| Developer(s) | INRIA |
|---|---|
| Type | Generator |
| License | CeCILL |
| Website | syntax.gforge.inria.fr |
In computer science, SYNTAX is a system used to generate lexical and syntactic analyzers (parsers) (both deterministic and non-deterministic) for all kind of context-free grammars (CFG) as well as some classes of contextual grammars. It is developed at INRIA (France) for several decades, mostly by Pierre Boullier, but has become free software since 2007 only. SYNTAX is distributed under the CeCILL license.
Contents |
SYNTAX handles most classes of deterministic (unambiguous) grammars (LR, LALR, RLR) as well as general context-free grammars. The deterministic version has been used in operational contexts (e.g., Ada[1]), and is currently used both in the domain of compilation[2]. The non-deterministic features include an Earley parser generator used for natural language processing[3]. Parsers generated by SYNTAX include powerful error recovery mechanisms, and allow the execution of semantic actions and attribute evaluation on the abstract tree or on the shared parse forest.
The current version of SYNTAX (version 6.0 beta) includes also parser generators for other formalisms, used for natural language processing as well as bio-informatics. These formalisms are context-sensitive formalisms (TAG, RCG) or formalisms that rely on context-free grammars and are extended thanks to attribute evaluation, in particular for natural language processing (LFG).