|
Lecturer(s)
|
-
Benedikovič Miroslav, RNDr.
|
|
Course content
|
Concept Language and Grammar. Grammars and Languages by Chomsky. Finite Automaton a Regular Grammars - Relations. Facilities of Regular Grammars, Regular Expression. Searching of lexeme, Using of Symbol Table (Binary Tree, Hashing...). Finite State Automaton, Building of Scanner. Context Free Grammars a Stack Automata - Their relation. Properties of Context Free Languages, Syntax Trees. LL a LR Languages - properties. LL(1), Left Recursion, and Left factorization. FIRST and FOLLOW Sets, Stack automata. Building of Parser, Parsing of declarations, Expressions, program, Subroutines... Semantic analyze of program. Goal Language, interpreting, Emitting of goal code.
|
|
Learning activities and teaching methods
|
|
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming), Methods of individual activities
|
|
Learning outcomes
|
The main goal of the course is to familiarise students with the basic knowledge in Theory of Grammars and Languages, and Theory of automata. Students obtain skills for creation of analyzers and compilers.
Student will teach create compilers and analyzers texts script in source text code.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Oral examination, Home assignment evaluation
|
|
Recommended literature
|
-
Aho, A. V., Sethi, R., Ullmann, J. D. Compilers, Principles, Techniques, and Tools. Berkley: Addison-Wesley Publishing Company, 2006. ISBN 978-0321486813.
-
Hopcroft, J. E., Ullmann, J. D. Formální jazyky a automaty. ALFA, Bratislava, 1978. ISBN 63-096-78.
-
Louden, Keneth C.. Compiler Construction - Principles and Praktice. Boston, PWS Publishing Comp., 1997.
-
Melichar, B. Gramatiky, automaty. ČVUT Praha, skriptum, 1978.
|