on the construction of lr(k) analyzers
A method for constructing almost optimal Floyd-Evans type Productions for LR(k) grammars is described here. Knuth has given the algorithm for constructing the analyzer. But its parsing table is too large and unacceptable for practical use. The concept of route indexes is used in our method. Using the concept it is possible to transform the transition diagram of Knuth's analyzer into another equivalent one whose number of statuses is much less than that of Knuth's transition diagram. As the result, we can get Productions which are optimal concerning both the time and the space efficiency, at the cost of the constructor complexity.
lr(k) analyzer production lr(k) grammar translator syntax analyzer production language parser deterministic language compiler compiler analyzer constructor language processor