Automatic generation for control table for DPLL(k) parser

• Autorzy: Jurek J.
• Języki publikacji: EN

Abstrakty

EN

DPLL(k) parser was proposed (Flasiński, Jurek, 1999) as an efficient tool for recognising complex trend junctions (patterns) which describe a behaviour of an industrial equipment. Although it was shown how to automatically generate a control table for a DPLL(1) parser, the problem of a construction of the table in a general case (k ≥ 21) was left for future research. In this paper we present the results of the research: a method of generation of a control table for any DPLL(k) parser.

Słowa kluczowe

EN

DPLL(k) grammar; parser; control table

PL

gramatyka DPLL(k); analizator składniowy; parser; tablica sterująca

• Wydawca: Wydawnictwo Politechniki Łódzkiej
• Czasopismo: Journal of Applied Computer Science
• Rocznik: 2003
• Tom: Vol. 11, nr 2
• Strony: 31--39
• Opis fizyczny: Bibliogr. 10 poz.

Twórcy

autor

Jurek J.

• Institute of Computer Science, Artificial Intelligence Systems Departament, Jagiellonian University, Nawojki 11, 30-072 Cracow, Poland

Bibliografia

• [1] Aho A.V., Ullman J.D.: The Theory of Parsing, Translation, and Compiling, Prentice-Hall, Englewood Cliffs, NJ, 1972.
• [2] Behrens U., Flasiński M., Hagge L., Ohrenberg K.: ZEX - An Expert System for ZEUS, IEEE Trans. Nuci. Sci. NS-41 (1994), pp.152-156.
• [3] Behrens U, Flasiński M., Hagge L., Jurek J., Ohrenberg K.: Recent developments of the ZEUS expert system ZEX, IEEE Trans. Nuci. Sci. NS-43 (1996), pp. 65-68.
• [4] Flasiński M.: Further Development of the ZEUS Expert System: Computer Science Foundations of Design, Deutsches Elektronen Synchrotron, Hamburg, 1994 (DESY Rep. 94-048).
• [5] Flasiński M, Jurek J.: Dynamically Programmed Automata for Quasi Context Sensitive Languages as a Tool for Inference Support in Pattern Recognition-Based Real-Time Control Expert Systems, Pattern Recognition, vol. 32, no. 4, (1999), pp. 671-690.
• [6] Fu K.S.: Syntactic Pattern Recognition and Applications, Prentice Hall, Englewood Cliffs, 1982.
• [7] Jurek J.: On the Linear Computational Complexity of the Parser for Quasi Context Sensitive Languages, Pattern Recognition Letters, no. 21 (2000), pp. 179-187.
• [8] Jurek J.: On the Pattern Generation Power of Parsable DPLL(k) Languages, Proc. First National Conf. On Pattern Recognition Systems, KOSYR’99, Trzebieszowice, Poland, 24-27 May 1999, pp. 367-373.
• [9] Rosenkrantz D.J.: Programmed grammars and classes of formal languages, J. ACM 16 (1969), pp. 107-131.
• [10] Rosenkrantz D.J., Steams R.E.: Properties of deterministic top-down grammars, Information and Control 17 (1970), pp. 226-256.