Programming Languages and Compilers WS 2013/14 - Slide 205
Objectives:
Equivalent forms of specification
In the lecture:
- Repeat calculi of the lectures "Modellierung" and "Berechenbarkeit und formale Sprachen".
- Our strategy: Specify regular expressions, transform into syntax diagrams, and from there into finite state machines
Suggested reading:
Kastens / Übersetzerbau, Section 3.1
Questions:
- Give examples for Unix tools which use regular expressions to describe their input.
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013