Subjects

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

Parsing Schemes 2 - NTIN041

Title:	Parsing schémata 2
Guaranteed by:	Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2020
Semester:	summer
E-Credits:	2
Hours per week, examination:	summer 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
Teaching methods:	full-time

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

Opinion survey results Examination dates SS schedule Noticeboard

Annotation -

Last update: T_KTI (19.05.2004)

The seminary isa continuation of TIN040 - Parsing schemata I. The main aim of the seminary is reading from the book of Klaas Sikkel, Parsing Schemata and other relevant texts.

Aim of the course -

Last update: RNDr. Jan Hric (07.06.2019)

To learn student to work with domain texts and to prepare own presentation. This will be based on student's own presentations.

Course completion requirements -

Last update: RNDr. Jan Hric (07.06.2019)

TBA

Literature - Czech

Last update: T_KTI (19.05.2004)

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.

Syllabus -

Last update: T_KTI (19.05.2004)

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

Parsing Schemata and other relevant texts.