Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Parsing Schemes 1 - NTIN040

Title:	Parsing schémata 1
Guaranteed by:	Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2020
Semester:	winter
E-Credits:	2
Hours per week, examination:	winter s.:0/2, C [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	Czech
Teaching methods:	full-time

Guarantor:	Martin Plátek, CSc.
Teacher(s):	Martin Plátek, CSc.
Class:	Informatika Mgr. - volitelný
Classification:	Informatics > Theoretical Computer Science
Is co-requisite for:	NTIN045, NTIN041, NTIN077, NTIN078

Annotation -

The main aim of the seminary is reading from the book of Klaas Sikkel, Parsing Schemata and other relevant texts. The seminary has a continuation.

Last update: T_KTI (19.05.2004)

Aim of the course -

TBA

Last update: Hric Jan, RNDr. (07.06.2019)

Course completion requirements -

TBA

Last update: Hric Jan, RNDr. (07.06.2019)

Literature - Czech

K. Sikkel : Parsing Schemata - a framework for specification and

analysis of parsing algorithms, Texts in Theoretical Computer Science -

An EATCS Series. ISBN 3-540-61650-0, Springer-Verlag, Berlin/Heidelberg/New York.

Last update: T_KTI (19.05.2004)

Syllabus -

The main aim of the seminary is reading from the book of Klaas Sikkel,

Parsing Schemata and other relevant texts.

Last update: T_KTI (19.05.2004)