e/Regular tree grammar

New Query

Information
has glosseng: In Computer Science, a regular tree grammar is a formal grammar that describes a set of directed trees.
lexicalizationeng: regular tree grammar
instance ofe/Formal language

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2025 Gerard de Melo.   Contact   Legal Information / Imprint