Difference between revisions of "SDF3"
Jump to navigation
Jump to search
| Line 6: | Line 6: | ||
Formal language definitions are very much related to (context-free) grammars, as we know them from automata. | Formal language definitions are very much related to (context-free) grammars, as we know them from automata. | ||
=== Definitions === <!--T:6--> | === Definitions === <!--T:6--> | ||
**sorts** | |||
Sorts are a | |||
=== Lexical vs Context free === <!--T:6--> | === Lexical vs Context free === <!--T:6--> | ||
== An example program == <!--T:6--> | == An example program == <!--T:6--> | ||
Revision as of 18:18, 8 September 2020
Syntax Definition Formalisms 3 (SDF3) is an academic syntax definition, used for compiling languages. It is part of the Spoofax workbench.
Intro
none yet
Syntax and language basics
Formal language definitions are very much related to (context-free) grammars, as we know them from automata.
Definitions
- sorts**
Sorts are a