Informatique fondamentale
De Polima.
Sommaire |
Regular languages and automata
- Final state machine (FSM) aka regular automata
- Regular languages
- Kleene Theorem : The regular languages are exactly the languages that are described by finite automata
- Notion of non determinism
- Classical Algorithms
...
Stack automata and Grammars
Pushdown Automata
Context free grammars
The two classes are equivalent !
Programming
| Step | C | Java |
|---|---|---|
| Lexical analysis | lex | flex |
| Syntaxic analysis | yacc OR bison | cup |
| Abstract syntaxic tree |
Divers
Compresser un dossier SVN sans prendre les fichiers spéciaux à svn
tar cvzf rep/ --exclude-vcs
Lecturer
- Laure Gonnord
Site web : Laure Gonnord
