Geodesic
The employment of Prolog for a syntax analysis in syntactic pattern recognition applications
Kybernetika, Tome 28 (1992) no. 1, pp. 62-68 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68N20, 68T10 
@article{KYB_1992_28_1_a4,
     author = {Kepka, Ji\v{r}{\'\i}},
     title = {The employment of {Prolog} for a syntax analysis in syntactic pattern recognition applications},
     journal = {Kybernetika},
     pages = {62--68},
     year = {1992},
     volume = {28},
     number = {1},
     mrnumber = {1159875},
     zbl = {0746.68055},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1992_28_1_a4/}
}
TY  - JOUR
AU  - Kepka, Jiří
TI  - The employment of Prolog for a syntax analysis in syntactic pattern recognition applications
JO  - Kybernetika
PY  - 1992
SP  - 62
EP  - 68
VL  - 28
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/KYB_1992_28_1_a4/
LA  - en
ID  - KYB_1992_28_1_a4
ER  - 
%0 Journal Article
%A Kepka, Jiří
%T The employment of Prolog for a syntax analysis in syntactic pattern recognition applications
%J Kybernetika
%D 1992
%P 62-68
%V 28
%N 1
%U http://geodesic.mathdoc.fr/item/KYB_1992_28_1_a4/
%G en
%F KYB_1992_28_1_a4
Kepka, Jiří. The employment of Prolog for a syntax analysis in syntactic pattern recognition applications. Kybernetika, Tome 28 (1992) no. 1, pp. 62-68. http://geodesic.mathdoc.fr/item/KYB_1992_28_1_a4/

[1] M. Chytil: Automata and Grammars (in Czech). SNTL, Prague 1984.

[2] K.S. Fu: Syntactic Pattern Recognition and Applications. Prentice-Hall, Englewood Cliffs, N.J. 1982. | Zbl

[3] R. Kurki-Suonio: On top-to-bottom recognition and left recursion. Coram. ACM 9 (1966), 7, 527 - 528. | Zbl

[4] W.F. Clocksin, C.S. Mellish: Programming in Prolog. Second edition. Springer-Verlag, Berlin - Heidelberg - New York 1984.

[5] Turbo Prolog - the natural language of artificial intelligence. Owner's Handbook, Borland Inter- national, Inc. 1988.

[6] T. V. Griffiths, S. R. Petrick: On the relative efficiencies of context-free grammar recognizers. Comm. ACM 8 (1965), 5, 289 - 300. | Zbl

[7] J. Earley: An efficient context-free parsing algorithm. Comm. ACM 13 (1970), 2, 94 - 102. | Zbl

[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.