Translation Grammar
From eplmediawiki
This is the approved revision of this page, as well as being the most recent.
A translation grammar is an ordered sixtuple TG = (T, N, SA, S, P, R) , where N and T are finite alphabets, SA is a finite set of semantic actions, S is a distinguished symbol of N, P is a finite non-empty set pairs (L,R) such that L and R are in (N U T)* and R is a set of pairs (p,a) where p is in P and a is in SA.
