Mathematical Foundations of Compilers' Theory - classes conducted in English at the B2+ level WM-MA-S2-E3-KOMP
The subject is devoted to algorithms and techniques for processing text strings, primarily syntactic analysis and sentence processing in formal languages. The various phases of compilers (lexical, syntactic and semantic analysis), classes of grammar and Chomsky's hierarchy will be explained. After completing the course, the student should be able to use regular expressions and understand the definitions of formal languages using grammar. Should be able to design a grammar and formally describe a parser for a simple context-free language. In addition, he should know the basic algorithms for searching for strings of characters and patterns in text.
(in Polish) Dyscyplina naukowa, do której odnoszą się efekty uczenia się
(in Polish) E-Learning
(in Polish) Grupa przedmiotów ogólnouczenianych
(in Polish) Opis nakładu pracy studenta w ECTS
Subject level
Learning outcome code/codes
Type of subject
Preliminary Requirements
Course coordinators
Assessment criteria
For all learning outcomes , the following assessment criteria are adopted for all forms of verification:
grade 5: fully achieved (no obvious shortcomings),
grade 4.5: achieved almost fully and criteria for awarding a higher grade are not met,
grade 4: largely achieved and the criteria for a higher grade are not met,
grade 3.5: largely achieved with a clear majority of positives and the criteria for granting a higher grade are not met,
grade 3: achieved for most of the cases covered by the verification and criteria for a higher grade are not met,
grade 2: not achieved for most of the cases covered by the verification.
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: