SC Language & Graph
Version 1.1 by ssm on 2013/05/03 14:55
The SC Language (SCL) and its graphical representation (SCG)
As mentioned in the introduction SCL is a minimal language. It consists of seven statements.
The SCG is a labelled graph G = (S, E), whereas
- the nodes S correspond to the statements of the program
- and the edges E reflect the sequential execution ordering
ABO example:
ABO SCL | ABO SCG |
|---|---|
|
|
