-
Notifications
You must be signed in to change notification settings - Fork 0
GrammarFormalisms
Alexander Koller edited this page May 29, 2017
·
1 revision
The following is an incomplete list of grammar formalisms that can be parsed by Alto. We only list formalisms for which Alto supports dedicated file formats. In general, the quickest way to encode a grammar formalism into Alto is to define an appropriate algebra and write an IRTG grammar that uses this algebra.
- Tree Automata
- Interpreted Regular Tree Grammars
- Regular Dependency Grammars