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.

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.

The selection of an appropriate key search algorithm for a specific application field is an important issue in application systems development. This is because data retrieval is the most time-consuming part of many application programs. An automatic selection method for key search algorithms is presented in this paper. The methodology has been implemented in a system called KESE2 (KEy-SEarch ALgorithm SElection). Key search algorithms are selected according to the user's requirements through interaction with KESE2 which bases its inferences on an evaluation table. This evaluation table contains values rating the performance of each key search algorithm for the different searching properties, or characteristics. The selection algorithm presented is based on step by step reduction of unsuitable key search algorithms and searching properties. The paper also proposes assistance facilities that consist of both a support function and a program synthesis function. Experimental results show that the appropriate key search algorithms are effectively selected, and that the necessary number of questions asked, to select the appropriate algorithm, is reduced to less than half of the total number of possible questions. The support function is useful for the user during the selection process and the program synthesis function fully translates a selected key search algorithm into high level language in an average of less than 1 hour.