Abstract | ||
---|---|---|
We propose an extension of primal grammars (Hermann u0026 Galbavý 1997). Primal grammars are term grammars with a high expressive power and good computational properties. The extended grammars have exactly the same properties but are more modular, more concise, and easier to use, as shown by some examples. An algorithm transforming any extended primal grammar into an equivalent primal grammar is provided. |
Year | Venue | Field |
---|---|---|
2008 | ISAIM | Rule-based machine translation,Programming language,Computer science,Grammar,Modular design,Expressive power |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
4 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Vincent Aravantinos | 1 | 86 | 10.29 |
Ricardo Caferra | 2 | 303 | 29.85 |
Nicolas Peltier | 3 | 50 | 11.84 |