In this thesis, a new language-the grammar writing language GWL which is a kind of problem oriented language for the transfer machine translation-is designed and implemented in order to make it easy to represent, test, and debug the linguistic grammar. The basic operation of the transfer machine translation is a tree-to-tree transformation. The tree-to-tree transformation is achieved by replacements and modifications of subtrees.
GWL has the hierarchical structure of the grammar and consists of GR (GRammar), PG (Part of Grammar), and RR (Rewriting Rule). GR is suitable to show the global flow of grammar. PG stands for grammars which can be modularizes independently. RR supports a tree-to-tree transformation using replacement and modification of a trees. In RR, 6 unary operations are used to represent any subtree structure in the input subtree.
In this thesis, ambiguities of a grammar is basically handled by the generation of all possible structures on the assumption that the preprocessing to minimize syntactic ambiguities is done.
