Website: | website met extra informatie | |||||||||||||||||||||||||||||||||||
Vakcode: | INFOB3TC | |||||||||||||||||||||||||||||||||||
Studiepunten: | 7.5 ECTS | |||||||||||||||||||||||||||||||||||
Historie: | Dit vak is de opvolger van Grammatica's en ontleden (INFOGONT). Je kunt maar een van beide vakken voor je examen opvoeren | |||||||||||||||||||||||||||||||||||
Periode: | periode 2 (week 46 t/m 5, d.w.z. 9-11-2020 t/m 5-2-2021; herkansing week 16) | ![]() | ||||||||||||||||||||||||||||||||||
Timeslot: | B | |||||||||||||||||||||||||||||||||||
Deelnemers: | tot nu toe 134 inschrijvingen | |||||||||||||||||||||||||||||||||||
Rooster: | De officiële roosters staan in MyTimetable | |||||||||||||||||||||||||||||||||||
Docenten: |
| |||||||||||||||||||||||||||||||||||
Inhoud: | Many programs take a sequence of symbols as input. These sequences almost always have some structure. Examples of such sequences of symbols are: programs in any programming language; a packet of information sent over the Internet; or information written into a file by a program (with the intention of that information being later re-read). The structure of those sequences is described with the help of grammars (grammatica's). From these descriptions one can automatically generate programs that recognise the corresponding structure, known as parsers (ontleders). This process of recognition is an important component of many programs, for example, a translator from one data type (say, a source code file) into another (the internal structures used by the compiler). The description of the process of translation makes use of a grammar formalism. By using some specific classes of grammars, we can not only express the structure of the sequence, but also ensure that the structure is easy to recognise; for example, that it can be recognised in linear time. Grammars play a central role in Computer Science, thus this course provides an important conceptual support for the rest of your studies. In this course you learn to design grammars, how to build parsers from those, and how to further use the result of those parser. You will see how to generate code for a subset of the C# programming language. More precisely, after successful completion of this course you will be able to:
In this course we use Haskell to describe the different components. Knowledge of this language at the level of the Functioneel programmeren course is thus required. | |||||||||||||||||||||||||||||||||||
Literatuur: |
| |||||||||||||||||||||||||||||||||||
Werkvorm: | The load per week is:
You are expected to do exercises from the lecture notes, listed on the website, by yourself. In case of questions, address yourself to the lecturer of the course. We may deviate from the above due to Corona. | |||||||||||||||||||||||||||||||||||
Toetsvorm: | The final grade depends on the two exams and three practical assignments.
Let's call your grade for the midterm M1 and the final exam grade M2 (both are zero if you did not take them at all).
| |||||||||||||||||||||||||||||||||||
Inspanningsverplichting voor aanvullende toets: | To be able to do the aanvullende toets, your score for the course should be at least 4.0 and less than 5.5, or it should be AANV. |