byucc.jhdl.synth.graph.parser.visitor
Interface Visitor

All Known Implementing Classes:
GraphBuilder

public interface Visitor

All visitors must implement this interface.


Method Summary
 void visit(attrAssignment n)
          f0 -> Identifier() f1 -> "=" f2 -> Identifier()
 void visit(attrDefs n)
          f0 -> attrItem() f1 -> ( [ ";" | "," ] attrItem() )*
 void visit(attrItem n)
          f0 -> attrAssignment() | attrMacro()
 void visit(attrList n)
          f0 -> "[" f1 -> [ attrDefs() ] f2 -> "]" f3 -> ( "[" [ attrDefs() ] "]" )*
 void visit(attrMacro n)
          f0 -> "@" f1 -> Identifier()
 void visit(attrStmt n)
          f0 -> attrType() [ Identifier() "=" ] attrList() | attrAssignment()
 void visit(attrType n)
          f0 -> "graph" | "node" | "edge"
 void visit(Body n)
          f0 -> "{" f1 -> [ StatementList() ] f2 -> "}"
 void visit(compound n)
          f0 -> simple() f1 -> [ rCompound() ] f2 -> [ attrList() ]
 void visit(dotfile n)
          f0 -> Header() f1 -> Body() f2 ->
 void visit(edgeOp n)
          f0 -> "->" | "--"
 void visit(Header n)
          f0 -> [ "strict" ] f1 -> ( "graph" | "digraph" ) f2 -> Identifier()
 void visit(Identifier n)
          f0 -> | | |
 void visit(node_List n)
          f0 -> nodeAtom() f1 -> [ "," node_List() ]
 void visit(nodeAtom n)
          f0 -> Identifier() f1 -> [ ":" Identifier() ]
 void visit(NodeList n)
           
 void visit(NodeListOptional n)
           
 void visit(NodeOptional n)
           
 void visit(NodeSequence n)
           
 void visit(NodeToken n)
           
 void visit(rCompound n)
          f0 -> edgeOp() f1 -> simple() f2 -> ( edgeOp() simple() )*
 void visit(simple n)
          f0 -> node_List() | subgraph()
 void visit(Statement n)
          f0 -> attrStmt() [ ";" ] | compound() [ ";" ]
 void visit(StatementList n)
          f0 -> Statement() f1 -> [ StatementList() ]
 void visit(SubgHdr n)
          f0 -> "subgraph" Identifier() | "subgraph"
 void visit(subgraph n)
          f0 -> [ SubgHdr() ] f1 -> Body()
 

Method Detail

visit

public void visit(NodeList n)

visit

public void visit(NodeListOptional n)

visit

public void visit(NodeOptional n)

visit

public void visit(NodeSequence n)

visit

public void visit(NodeToken n)

visit

public void visit(dotfile n)
f0 -> Header() f1 -> Body() f2 ->


visit

public void visit(Header n)
f0 -> [ "strict" ] f1 -> ( "graph" | "digraph" ) f2 -> Identifier()


visit

public void visit(Body n)
f0 -> "{" f1 -> [ StatementList() ] f2 -> "}"


visit

public void visit(StatementList n)
f0 -> Statement() f1 -> [ StatementList() ]


visit

public void visit(Statement n)
f0 -> attrStmt() [ ";" ] | compound() [ ";" ]


visit

public void visit(compound n)
f0 -> simple() f1 -> [ rCompound() ] f2 -> [ attrList() ]


visit

public void visit(simple n)
f0 -> node_List() | subgraph()


visit

public void visit(edgeOp n)
f0 -> "->" | "--"


visit

public void visit(rCompound n)
f0 -> edgeOp() f1 -> simple() f2 -> ( edgeOp() simple() )*


visit

public void visit(node_List n)
f0 -> nodeAtom() f1 -> [ "," node_List() ]


visit

public void visit(nodeAtom n)
f0 -> Identifier() f1 -> [ ":" Identifier() ]


visit

public void visit(attrStmt n)
f0 -> attrType() [ Identifier() "=" ] attrList() | attrAssignment()


visit

public void visit(attrType n)
f0 -> "graph" | "node" | "edge"


visit

public void visit(attrList n)
f0 -> "[" f1 -> [ attrDefs() ] f2 -> "]" f3 -> ( "[" [ attrDefs() ] "]" )*


visit

public void visit(attrDefs n)
f0 -> attrItem() f1 -> ( [ ";" | "," ] attrItem() )*


visit

public void visit(attrItem n)
f0 -> attrAssignment() | attrMacro()


visit

public void visit(attrAssignment n)
f0 -> Identifier() f1 -> "=" f2 -> Identifier()


visit

public void visit(attrMacro n)
f0 -> "@" f1 -> Identifier()


visit

public void visit(subgraph n)
f0 -> [ SubgHdr() ] f1 -> Body()


visit

public void visit(SubgHdr n)
f0 -> "subgraph" Identifier() | "subgraph"


visit

public void visit(Identifier n)
f0 -> | | |



Copyright ? 2006 Brigham Young University, Configurable Computing Laboratory. All Rights Reserved.