Graduate Education Institute · Computer Science and Engineering · Master
ECTS: 7.5 T+P+L: 3+0+0 Departmental Elective
Coordinator:
Course Objective
Aim of this course is to present mathematical methods concerning design of programming languages and to make tools possible for acceptance conditions of a program which is written in a particular program language
Course Content
Basic mathematics for languages,Regular expression and sets,Deterministic and nondeterministic automata,gramer and languages,Regular languages,context free languages, recovering gramer and normal forms, pushdown automata ,Turing machine,Top-down parsing, classification of languages, LL(k) Languages and LR(k) languages, Shif-Reduce and Recursive-decent parsing methods
Course Learning Outcomes
- Students improve their language learning and design skills. Students earn programming techniques and optimization skills.
- the student will be able to synthesize finite automata with specific properties.
- the student will be able to apply transformation between multiple representations of finite automata.
- the student will be able to define the definitions of machine models formally.
Core Area Distribution
(48) Computing%70 (52) Engineering and Engineering Trades%30