SubjectsSubjects(version: 845)
Course, academic year 2018/2019
   Login via CAS
Parsing Schemes I - NTIN040
Title in English: Parsing schémata I
Guaranteed by: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Faculty: Faculty of Mathematics and Physics
Actual: from 2015 to 2019
Semester: winter
E-Credits: 3
Hours per week, examination: winter s.:0/2 C [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: Czech
Teaching methods: full-time
Guarantor: Martin Plátek, CSc.
Class: Informatika Mgr. - volitelný
Classification: Informatics > Theoretical Computer Science
Is co-requisite for: NTIN041
Annotation -
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. The seminary has a continuation.
Aim of the course - Czech
Last update: T_KTI (26.05.2008)

Pomocí referátů naučit studenty pracovat s odbornmým textem

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.

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html