<TR>
<TD ALIGN=RIGHT><I>a_list</I></TD>
<TD ALIGN=LEFT>:</TD>
- <TD ALIGN=LEFT><I>ID</I> [ <B>'='</B> <I>ID</I> ] [ <B>','</B> ] [ <I>a_list</I> ]</TD>
+ <TD ALIGN=LEFT><I>ID</I> <B>'='</B> <I>ID</I> [ <B>','</B> ] [ <I>a_list</I> ]</TD>
</TR>
<TR>
<TD ALIGN=RIGHT><I>edge_stmt</I></TD>
An <I>edgeop</I> is <TT>-></TT> in directed graphs and <TT>--</TT> in
undirected graphs.
<P>
-An <I>a_list</I> clause of the form <I>ID</I> is equivalent to
-<I>ID</I><TT>=true</TT>.
-<P>
The language supports C++-style comments: <TT>/* */</TT> and <TT>//</TT>.
In addition, a line beginning with a '#' character is considered a line
output from a C preprocessor (e.g., # 34 to indicate line 34 ) and discarded.
stmt = node_stmt | edge_stmt | attr_stmt | ID '=' ID | subgraph
attr_stmt = ( T_graph | T_node | T_edge ) attr_list
attr_list = '[' [ a_list ] ']' [ attr_list ]
-a_list = ID [ '=' ID ] [ ',' ] [ a_list ]
+a_list = ID '=' ID [ ',' ] [ a_list ]
edge_stmt = ( node_id | subgraph ) edgeRHS [ attr_list ]
edgeRHS = edgeop ( node_id | subgraph ) [ edgeRHS ]
node_stmt = node_id [ attr_list ]
An <I>edgeop</I> is <TT>-></TT> in directed graphs and <TT>--</TT> in
undirected graphs.
<P>
-An <I>a_list</I> clause of the form <I>ID</I> is equivalent to
-<I>ID</I><TT>=true</TT>.
-<P>
The language supports C++-style comments: <TT>/* */</TT> and <TT>//</TT>.
In addition, a line beginning with a '#' character is considered a line
output from a C preprocessor (e.g., # 34 to indicate line 34 ) and discarded.