Previous |  Up |  Next

Article

References:
[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. MR 0912714 | Zbl 0642.68143
[2] J. Lewi, al: The ELL(1) Parser Generator and the Error Recovery Mechanism. Acta Inform. 10 (1978), 209-228. Zbl 0369.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.)
[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.)
[5] M. Plátek: Independent error messages. In: SOFSEM'91, Czechoslovak Society for Computer Science, Jasná pod Chopkom 1991, pp. 257-260.
[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.
[7] M. Plátek, J. Vogel: Deterministic list automata and erasing graphs. The Prague Bulletin of Mathematical Linguistics 45 (1986), 27-50. MR 0845522
[8] M. Plátek, B. Tichá: List automata as dependency parsers. The Prague Bulletin of Mathematical Linguistics 50 (1988), 71-88.
[9] N. Wirth: Algorithms + Data Structures = Programs. Prentice-Hall, Englewood Cliffs, NJ 1975. MR 0440982
Partner of
EuDML logo