This letter improves the technique proposed previously for speeding up stack-controlling LALR(1) parsers. The efficient actions of the improved parsers are more than those of the parsers by the previous scheme.

This letter is concerned with 2k-ary cyclic AN codes for burst error correction. We present the relation between the burst error correcting ability of a binary cyclic AN code and that of a 2k-ary cyclic AN code when these codes are generated by the same generator A.

This letter presents the precise stack-controlling LALR(1) parser that can perform finite state recognition locally without associated stack manipulations. The presented parser can be applicable to the subclass of the LALR(1) grammars.

This letter presents a method for removing undesirable push actions introduced by a lookahead solution from stack-controlling LALR(1) parsers. By this method, the same parsing algorithm can be surely used for all stack-controlling LALR(1) parsers.