Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

Version 1 Next »

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 SCLABO SCG
  • No labels