We have to choose correct one from these different options. Next step is to generate the glyph sequence from the sequence of literals obtained. A rule based algorithm is described below. There will be a number of clauses such that each one has a condition and an expression returning a value. If two clauses satisfy the condition, the first one will be selected lexically.
X is null.
Last literal of X is not a vocal literal. In any of the above cases, X 1 is non-null. From the above algorithm, we may see that many literals have exactly same joining property with other literals. The concept of classes of literals gives flexibility for number of literals to defer between schemes. This makes it easy for generalised implementation of the rules since the classes alone are fixed.