VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
Understanding Context-Free Parsing Algorithms
Last Updated: 2026-02-05 16:22:56
Abstract
Parsing context-free grammars is a fundamental problem in natural language processing and computer science more broadly. This seminar will explore a classic text that unifies many algorithms for parsing in one framework.
Objective
Sikkel's notion of parsing schemata is explored in depth. The students should take away an understanding and fluency with these ideas.
Content
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Resources
Learning Materials (Links)
- Main link
- Information
General Information
- Language
- English
- Levels
- BSC
- Frequency
- Yearly recurring
Examination
- Type
- graded semester performance
Registration & Places
- Max Places
- 24
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| seminar |
Understanding Context-Free Parsing Algorithms
Does not take place this semester.
|
No time listed | 2 h weekly |
Offered In
-
-
Seminar (Students may also choose a seminar from the Master's program in Computer Science. It is their responsibility to make sure that they meet the requirements and conditions for this seminar.)
-