A Grammar Writing Language for the Machine Translation System Using Transfer Method

Abstract

A Grammar Writing Language, which has tree to tree transformation as basic operation, is designed and implemented. Grammars which are used in three stages, i.e. Analysis, Transfer and Generation can be expressed by GWL. To easily express grammar rules which contain tree to tree transformation, GWL offer 6 unary operators-Unique, One, Dagger, Optional, Any, Star. By these operators each grammar rule can be simply expressed. And in order to increase productivity of grammar writing and readability of written grammar GWL supports not only general control structure but also abstracted control structure.