Previous |  Up |  Next

Article

Title: The employment of Prolog for a syntax analysis in syntactic pattern recognition applications (English)
Author: Kepka, Jiří
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 28
Issue: 1
Year: 1992
Pages: 62-68
.
Category: math
.
MSC: 68N20
MSC: 68T10
idZBL: Zbl 0746.68055
idMR: MR1159875
.
Date available: 2009-09-24T18:29:57Z
Last updated: 2012-06-05
Stable URL: http://hdl.handle.net/10338.dmlcz/124972
.
Reference: [1] M. Chytil: Automata and Grammars (in Czech).SNTL, Prague 1984.
Reference: [2] K.S. Fu: Syntactic Pattern Recognition and Applications.Prentice-Hall, Englewood Cliffs, N.J. 1982. Zbl 0521.68091
Reference: [3] R. Kurki-Suonio: On top-to-bottom recognition and left recursion.Coram. ACM 9 (1966), 7, 527 - 528. Zbl 0138.10107
Reference: [4] W.F. Clocksin, C.S. Mellish: Programming in Prolog.Second edition. Springer-Verlag, Berlin - Heidelberg - New York 1984.
Reference: [5] : Turbo Prolog - the natural language of artificial intelligence.Owner's Handbook, Borland Inter- national, Inc. 1988.
Reference: [6] T. V. Griffiths, S. R. Petrick: On the relative efficiencies of context-free grammar recognizers.Comm. ACM 8 (1965), 5, 289 - 300. Zbl 0131.16006
Reference: [7] J. Earley: An efficient context-free parsing algorithm.Comm. ACM 13 (1970), 2, 94 - 102. Zbl 0185.43401
Reference: [8] J. Kepka: The Top-Down Parsing of Context-Free Languages and Its Realization in Turbo Prolog (in Czech).Research Report No. 1681, UTIA CSAV, Prague 1990.
.

Files

Files Size Format View
Kybernetika_28-1992-1_5.pdf 407.7Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo