Pla
- Booleans
S d Pi
- Steps towards a Pico e
– Step 1: define syntax – Step 2: define a type che – Step 3: define an evaluat
Step 3: define an evaluat
– Step 4: define a compile
T l f ti
- Traversal functions
- Methodology
Introduction
an
i nvironment
ecker tor tor er
to ASF+SDF 1
Methodo Methodo
St i t ti b t
- Strict separation between
signature definitions
- Modularize syntax definit
“functionality”: statement
- Modularize signature def
functionality: type check, functionality: type check,
Introduction
- logy (1)
- logy (1)
d fi iti d n syntax definitions and tions based on sorts or ts, expressions, types, etc. finitions based on , evaluate, collect, etc. , evaluate, collect, etc.
to ASF+SDF
Methodo Methodo
T t l f ifi ti
- Two styles of specificatio
– Functional (e.g. PICO typ
- Explicit control over applic
- Tedious except in combina
– Algebraic (e.g. Booleans)
- No control over application
- Concise
- Very local behavior no glo
Introduction
- logy (2)
- logy (2)
- ns:
e checker)
cation of functions/rewrite rules ation with traversal functions n of rewrite rules
- bal information can be used
to ASF+SDF
Methodo Methodo
St i t ti b t
- Strict separation between
signature definitions
- Modularize syntax definit
“functionality”: statement
- Modularize signature def
functionality: type check, functionality: type check,
- Use predefined libraries w
Introduction
- logy (3)
- logy (3)
d fi iti d n syntax definitions and tions based on sorts or ts, expressions, types, etc. finitions based on , evaluate, collect, etc. , evaluate, collect, etc. whenever possible
to ASF+SDF