Parsing Schemes II - NTIN041

• Title: Parsing schémata II
• Guaranteed by: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
• Faculty: Faculty of Mathematics and Physics
• Actual: from 2015 to 2019
• Semester: summer
• E-Credits: 3
• 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

Annotation

English

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.

Czech

Last update: T_KTI (19.05.2004)

Seminář je pokračováním semináře TIN040 - Parsing schemata I. Je zaměřen na rozvíjení metodiky vyložené v knize Klaase Sikkela, Parsing Schemata.

Aim of the course

Last update: T_KTI (26.05.2008)

Pomocí referátů naučit studenty pracovat s odborným textem a připravit si vlastní prezentaci

Literature

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

English

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.

Czech

Last update: T_KTI (19.05.2004)

Hlavní náplň spočívá v postupném referování knihy Klaase Sikkela, Parsing Schemata

a dalších relevantních textů.