Skip to content

GrammarFormalisms

Alexander Koller edited this page May 29, 2017 · 1 revision

Different Grammar Formalisms

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.

  1. Tree Automata
  2. Interpreted Regular Tree Grammars
  3. Regular Dependency Grammars
Clone this wiki locally