Augmented Syntax Diagrams (ASDs) are networks of directed graphs used to denote English grammar rules.

 Although they look similar to finite-state grammars, they are more powerful than context-free grammars, yet efficient for parsing.

 The graph nodes can be augmented with computations similar to Wood's ATN registers.  An ASDParser and an ASDEditor have been developed in Java by  Prof. James A. Mason  from York University, which are in the public domain.

 It has become possible recently to use ASDs as Decision Networks, where the nodes represent values for decision variables.   Nodes on a path from an initial node to a final node are conjoined (AND), and the presence of more than one outgoing edge represents a disjunction (OR).