Construction of a robust parser from a deterministic reduced parser

Martin Plátek

Kybernetika (1997)

  • Volume: 33, Issue: 3, page 311-332
  • ISSN: 0023-5954

How to cite

top

Plátek, Martin. "Construction of a robust parser from a deterministic reduced parser." Kybernetika 33.3 (1997): 311-332. <http://eudml.org/doc/27864>.

@article{Plátek1997,
author = {Plátek, Martin},
journal = {Kybernetika},
keywords = {parser},
language = {eng},
number = {3},
pages = {311-332},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Construction of a robust parser from a deterministic reduced parser},
url = {http://eudml.org/doc/27864},
volume = {33},
year = {1997},
}

TY - JOUR
AU - Plátek, Martin
TI - Construction of a robust parser from a deterministic reduced parser
JO - Kybernetika
PY - 1997
PB - Institute of Information Theory and Automation AS CR
VL - 33
IS - 3
SP - 311
EP - 332
LA - eng
KW - parser
UR - http://eudml.org/doc/27864
ER -

References

top
  1. M. Chytil, J. Demner, Panic Mode without Panic, In: Automata, Languages and Programming (Lecture Notes in Computer Science 267). Springer-Verlag, Berlin--Heidelberg--New York 1987. (1987) Zbl0642.68143MR0912714
  2. J. Lewi, al, The ELL(1) Parser Generator and the Error Recovery Mechanism, Acta Inform. 10 (1978), 209-228. (1978) Zbl0369.68039
  3. J. Matas, Construction of Reduced and l-Corrected List Automata, Diploma Thesis, Department of Theoretical Computer Science, Faculty of Mathematics and Physics, Charles University, Prague 1993. (In Czech.) (1993) 
  4. Nguyen Xuan Dung, On Decidability of Skeletal Sets, Ph. D. Thesis, Department of Theoretical Computer Science, Faculty of Mathematics and Physics, Charles University, Prague 1988. (In Czech.) (1988) 
  5. M. Plátek, Independent error messages, In: SOFSEM'91, Czechoslovak Society for Computer Science, Jasná pod Chopkom 1991, pp. 257-260. (1991) 
  6. M. Plátek, Syntactic Error Recovery with Formal Guarantees I, Technical Report No. 100, Department of Theoretical Computer Science, Faculty of Mathematics and Physics, Charles University, Prague 1992. (1992) 
  7. M. Plátek, J. Vogel, Deterministic list automata and erasing graphs, The Prague Bulletin of Mathematical Linguistics 45 (1986), 27-50. (1986) MR0845522
  8. M. Plátek, B. Tichá, List automata as dependency parsers, The Prague Bulletin of Mathematical Linguistics 50 (1988), 71-88. (1988) 
  9. N. Wirth, Algorithms + Data Structures = Programs, Prentice-Hall, Englewood Cliffs, NJ 1975. (1975) MR0440982

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.