Dataflow Software Stack
032db78
Master Thesis of Mathijs Saey at the VUB
|
Node parser. More...
Functions | |
def | parseSubGraph |
Parse a standard subgraph. More... | |
def | parseCompoundSubGraph |
Parse a subgraph of a compound node. More... | |
def | parseGraph |
Determine which kind of subgraph we are dealing with. More... | |
def | parseNode |
def | parseCompoundStart |
Parse the start of a compound node. More... | |
def | parseCompoundEnd |
Variables | |
int | _n_label_idx = 1 |
int | _n_code_idx = 2 |
int | _g_type_idx = 1 |
int | _g_name_idx = 2 |
int | _cs_label_idx = 2 |
int | _cs_code_idx = 3 |
int | _ce_label_idx = 1 |
int | _ce_code_idx = 2 |
int | _ce_len_idx = 3 |
int | _ce_lis_idx = 4 |
Node parser.
This module allows us to parse all of the graph elements (compound nodes, nodes and subgraphs)
def frontEnd.IF1.graph.parseSubGraph | ( | arr, | |
ctr | |||
) |
Parse a standard subgraph.
def frontEnd.IF1.graph.parseCompoundSubGraph | ( | arr, | |
ctr | |||
) |
Parse a subgraph of a compound node.
def frontEnd.IF1.graph.parseGraph | ( | arr, | |
ctr | |||
) |
Determine which kind of subgraph we are dealing with.
def frontEnd.IF1.graph.parseNode | ( | arr, | |
ctr | |||
) |
def frontEnd.IF1.graph.parseCompoundStart | ( | arr, | |
ctr | |||
) |
Parse the start of a compound node.
We do this by creating a compound scope to store the subgraphs. We also tell the environment that we entered a compound node.
Finally, we add a dummy node that will be popped by the first subgraph we meet.
def frontEnd.IF1.graph.parseCompoundEnd | ( | arr, | |
ctr | |||
) |
int frontEnd.IF1.graph._n_label_idx = 1 |
int frontEnd.IF1.graph._n_code_idx = 2 |
int frontEnd.IF1.graph._g_type_idx = 1 |
int frontEnd.IF1.graph._g_name_idx = 2 |
int frontEnd.IF1.graph._cs_label_idx = 2 |
int frontEnd.IF1.graph._cs_code_idx = 3 |
int frontEnd.IF1.graph._ce_label_idx = 1 |
int frontEnd.IF1.graph._ce_code_idx = 2 |
int frontEnd.IF1.graph._ce_len_idx = 3 |
int frontEnd.IF1.graph._ce_lis_idx = 4 |