A | |
add [Worklist] | add w l adds every element of list l to the worklist w .
|
add [Table.Table] | |
add_adjacency_list [Graph] | add_adjacency_list g v l adds for all vertices u in l
an edge (v,u) to graph g .
|
add_delta [Mtt] | |
add_edge [Graph] | add_edge g x y adds to graph g the edge from x to y ,
i.e.
|
add_rule [Mtt] | |
add_sigma [Mtt] | |
add_state [Mtt] | |
add_symbol [SymbolTable] | |
add_vertex [Graph] | add_vertex g v adds vertex v to graph g .
|
adjacent_vertices [Graph] | adjacent_vertices g v returns all vertices u such that
there exists an edge (v,u) in g .
|
B | |
bot [Solve.Domain] |
The bottom element of the domain.
|
C | |
choose [Worklist] |
Returns an element of the worklist.
|
clear [Worklist] |
Empty a worklist.
|
component_graph [Graph] | component_graph G returns the component graph SCC(G)
obtained by shrinking each strongly connected component of G
to a single vertex.
|
copy [Graph] |
Return a copy of the given graph.
|
create [Table.Table] | |
create [SymbolTable] | |
D | |
delta_of_ord [Mtt] | |
delta_to_string [Mtt] | |
dfs1 [Graph] | |
E | |
edges [Graph] | edges g returns the set E of edges of g as a list of
pairs.
|
empty [Worklist] |
Returns an empty worklist.
|
empty [Mtt] | |
empty [Graph] | empty () returns an empty graph.
|
eq [Table.ItemEq] | |
eq [Table.Table] | |
eq [SymbolTable] | |
eq [Solve.Domain] | eq x y is true if x = y , otherwise it is false .
|
eq [Solve.ItemEq] | eq x y is true if x = y , otherwise it is false .
|
extract [Worklist] | extract w extracts and removes an element from the worklist.
|
F | |
from_list [Graph] | from_list g l adds to graph g all edges that are contained
in list l .
|
G | |
get_action [Mtt] | |
get_index [SymbolTable] | |
get_init [Mtt] | |
get_symbol [SymbolTable] | |
I | |
in_degree [Graph] | in_degree g x returns the number of edges with x as their
terminal vertex.
|
is_empty [Worklist] | is_empty w returns true if and only if w contains no elements,
otherwise it returns false .
|
is_empty [Graph] |
Returns
true if and only if the set of vertices of the given
graph is empty.
|
iter [Table.Table] | |
iter [SymbolTable] | |
L | |
label [Tree] | label x returns the label of the root node of x .
|
list_to_string [Util] | list_to_string f open close sep l represents the list l
as string.
|
lookup [Table.Table] | |
lookup [SymbolTable] | |
lookup_all [Table.Table] | |
lub [Solve.Domain] |
The least upper bound of two elements of the domain.
|
M | |
main [Parser] | |
mem [Worklist] | mem w x returns true if and only if w contains x , otherwise
it returns false .
|
mem [Table.Table] | |
mem [SymbolTable] | |
N | |
nth [Tree] | nth n x returns the n-th successor of x .
|
O | |
ord_of_delta [Mtt] | |
ord_of_sigma [Mtt] | |
ord_of_state [Mtt] | |
out_degree [Graph] | out_degree g x returns the number of edges with x as their
initial vertex.
|
P | |
print_delta [Mtt] | |
print_sigma [Mtt] | |
print_states [Mtt] | |
R | |
reachable [Graph] | reachable g v returns all vertices u that are reachable
from vertex v , i.e.
|
read [Tree] | read s f reads a tree encoded as XML from file s
and returns it.
|
read [ReadMtt] | |
remove [Worklist] |
Removes an element from the worklist.
|
rev_lookup [Table.Table] | |
rm [Table.Table] | |
rm_symbol [SymbolTable] | |
run [ExecMtt] | |
S | |
scc [Graph] | scc g returns the strongly connected components of g .
|
set_init [Mtt] | |
sigma_of_ord [Mtt] | |
sigma_to_string [Mtt] | |
single [Worklist] | single x returns a worklist containing only the element x .
|
solve [Solve.Solver] | solve s l solves the given system s of equations at
least for the variables given by l .
|
sons [Tree] | sons x returns the list of direct successors of the
tree x .
|
state_of_ord [Mtt] | |
state_to_string [Mtt] | |
T | |
to_string [Tree] | to_string x returns a string representation of x .
|
to_string [Table.ItemEq] | |
to_string [Table.Table] | |
to_string [SymbolTable] | |
to_xml [Tree] | to_xml x returns an XML representation of x .
|
topological_sort [Graph] | top_sort g returns a topological sort of graph g such that
if g contains an edge (u,v), then u appears
before v in the ordering.
|
transpose [Graph] | transpose g returns the transpose of g .
|
U | |
union [Worklist] | union w1 w2 adds all elements of worklist w2 to worklist
w1 .
|
V | |
vertices [Graph] | vertices g returns the set V of vertices of g as a
list.
|