Attention! Project classes begin on Tuesday 27 September 2011. Please divide yourselves into groups of up to 28 persons while taking into account notes included in the Project section.
Attention! Persons who do not have their registration number listed on the list of grades and absences, or whose registration number is written in italics there, MUST have problems with their status solved as soon as possible as they are not listed as they are not lited among students elligible for attending the classes of the subject. Due to lack of space, those persons cannot attend classes.
Example tasks (about 50% of the total number points) for a test (section numbers from the textbook):
1. Plot a graph of a scanner that implements given functions (sections 1.5.4, 2.1, 2.3)
2. Write a code for a generator of scanners (lexical analyzers) implementing given functions (sections 1.5.4, 2.2.1, 5)
3. Design grammar rules describing given syntax of data (sections 1.2, 1.3, 1.5.5, 3.2)
4. Write a code for a parser generator given a grammar (sections/chapters 1.2, 1.3, 6)
Example theoretical questions (about 50% of the total number points) for a test (chapter numbers fro the book) - definitions, types, features, exaples, etc. for the following issues:
1. Formal languages, XBNF notation, Chomsky's classification, multitape machines (sections 1.1-4)
2. Construction and inner working of compilers, lexical, syntactical and semantical analysis (sections 1.5, 2.3, 4.1, 4.2)
3. Finite automata, grammars, and regular expressions (sections 2.1, 2.2)
4. Descending and ascending analysis, LR(0), SLR(1), LR(1) i LALR(1) analyzers (sections 3.1, 3.2, 3.3)
5. Scanner and parser generators (chapters 5 i 6)
6. Code optimisation (section 4.3)
7. Analysis of logical and arithmetic expressions, Generation of assembly code computing a value (section 7.2)
Handouts for the lecture are available at the copy center.