diff options
| -rw-r--r-- | src/packrat-parse_graphs.ads | 20 |
1 files changed, 2 insertions, 18 deletions
diff --git a/src/packrat-parse_graphs.ads b/src/packrat-parse_graphs.ads index 4d2d956..208292c 100644 --- a/src/packrat-parse_graphs.ads +++ b/src/packrat-parse_graphs.ads @@ -19,23 +19,6 @@ generic package Packrat.Parse_Graphs is - -- get rid of Parse_Cursor and replace with Finished_Tokens, - -- rewrite Groups to also use Finished_Tokens - - -- this will allow simplification regarding checks for same graphs, etc - - -- there should be pruning functions for Token, Finished_Token, Token_Group, - -- and for removing all bits unreachable from the root - - -- by inserting and building the parse graph from the bottom up, - -- no pruning needs to be done while parsing until the very end, - -- as even if a bit of parsing fails then the nodes will either be used later - -- or stay unreachable, and thus a single removal of all unreachable - -- nodes at the end will suffice - - -- Token_Groups should include a record of their parent node to make other things easier - - type Parse_Graph is tagged private; function "=" @@ -302,7 +285,8 @@ package Packrat.Parse_Graphs is -- An ambiguous graph means that either some node exists with multiple groups -- attached to it with the same Group_Finish value, or the root node has multiple - -- groups of any Group_Finish value attached to it. + -- groups of any Group_Finish value attached to it, or there are multiple + -- root nodes. function Is_Root_Ambiguous (Container : in Parse_Graph) |