Scope dependencies computations using OCamlgraph
Vertices: scope variables or subscopes.
The vertices of the scope dependency graph are either :
Indeed, during interpretation, subscopes are executed atomically.
module Vertex : sig ... endmodule Edge : Graph.Sig.ORDERED_TYPE_DFT with type t = Utils.Pos.tOn the edges, the label is the position of the expression responsible for the use of the variable. In the graph, x -> y if x is used in the definition of y.
module ScopeDependencies :
Graph.Sig.P with type V.t = Vertex.t and type E.label = Edge.tModule of the graph, provided by OCamlGraph
Returns an ordering of the scope variables and subscope compatible with the dependencies of the computation
val correct_computation_ordering : ScopeDependencies.t -> Vertex.t listReturns an ordering of the scope variables and subscope compatible with the dependencies of the computation
val check_for_cycle : Ast.scope -> ScopeDependencies.t -> unitOutputs an error in case of cycles.
val build_scope_dependencies : Ast.scope -> ScopeDependencies.tBuilds the dependency graph of a particular scope
module ExceptionsDependencies :
Graph.Sig.P with type V.t = Ast.RuleName.t and type E.label = Edge.tval build_exceptions_graph :
Ast.rule Ast.RuleMap.t ->
Ast.ScopeDef.t ->
ExceptionsDependencies.tval check_for_exception_cycle : ExceptionsDependencies.t -> unit