stem is a state machine

steam expands state machine which is used to evaluate state maps

state map is a 2d map of stateQ

stateQ is a queue of states

action on states are either use-type of select-type

use-type action means perfomeing a atomic action based on selected states

select-type state means selecting a state for performing actions

steam code is a low-high level language written in c++

it has a concept of cells

cells is a multi-variable has number of phases

phase are like "types"

• float
• interger
• string
• refernce

map is the fundamental block which is written in this code

• i.e maps are what hold cells
• operation on cells
• hooks to other maps
• inclusions of libs

different maps are connected by hooks

hooks can be conditional and un-conditional

keys : second to none but map, keys are of prime importance.

• they handle all the basic operation like arithmatics, comparison, selection
• they are also responsible for data tranfer b/w maps

there are two types of keys

• dependent keys - used with the cell and feeder
• independent keys - used only with the cell

feeder is a another type of action based state which takes data and based on the dependent key use it to either move, transform... etc.

stem code dont use parser (its a grammar less lang)

• because it uses limited states -we dont call it state machine for nothing.

some examples

• how to make a loop

• source code

• 

• output

• 

• using hooks

• source code

• 

• output

• 

• a simple program using cells

• source code

• 

• output

•