📄 graphviz_digraph_parser.cpp
字号:
switch (yyn) {
case 2:
{yyval.i=0;;
break;}
case 3:
{
graphviz::vlist.clear();
graphviz::attributes.clear();
graphviz::subgraphs.clear();
graphviz::nodes.clear();
std::string* name = static_cast<std::string*>(yyvsp[0].ptr);
graphviz::previous_graph = static_cast<graphviz::Subgraph*>(g);
graphviz::current_graph = static_cast<graphviz::Subgraph*>(g);
graphviz::set_graph_name(*name);
delete name;
;
break;}
case 6:
{yyval.ptr = yyvsp[0].ptr; ;
break;}
case 7:
{yyval.ptr=(void*)(new std::string("G")); ;
break;}
case 14:
{
graphviz::set_attribute(*graphviz::current_graph,
graphviz::attribute_state);
;
break;}
case 15:
{ graphviz::attribute_state = GRAPH_GRAPH_A; ;
break;}
case 16:
{ graphviz::attribute_state = GRAPH_NODE_A; ;
break;}
case 17:
{ graphviz::attribute_state = GRAPH_EDGE_A; ;
break;}
case 19:
{;
break;}
case 22:
{
std::string* name = static_cast<std::string*>(yyvsp[-2].ptr);
std::string* value = static_cast<std::string*>(yyvsp[0].ptr);
graphviz::attributes[*name] = *value;
delete name;
delete value;
;
break;}
case 29:
{ yyval.i = 0; ;
break;}
case 30:
{
graphviz::set_attribute(
*static_cast<graphviz::Subgraph*>(graphviz::current_graph),
GRAPH_GRAPH_A);
;
break;}
case 31:
{
graphviz::Vertex* temp = static_cast<graphviz::Vertex*>(yyvsp[-1].ptr);
graphviz::current_vertex = *temp;
graphviz::set_attribute(*static_cast<GRAPHVIZ_GRAPH*>(YYPARSE_PARAM),
NODE_A);
delete temp;
yyval.i = 0;
;
break;}
case 32:
{ yyval.i=0; ;
break;}
case 33:
{ yyval.i=0; ;
break;}
case 34:
{
std::string* name = static_cast<std::string*>(yyvsp[0].ptr);
std::pair<graphviz::Iter, bool> result = graphviz::lookup(*name);
if (result.second) {
graphviz::current_vertex = result.first->second;
if (! graphviz::current_graph->is_root())
boost::add_vertex(graphviz::current_vertex, *graphviz::current_graph);
} else
graphviz::current_vertex = graphviz::add_name(*name, *static_cast<GRAPHVIZ_GRAPH*>(YYPARSE_PARAM)) ;
graphviz::Vertex* temp = new graphviz::Vertex(graphviz::current_vertex);
yyval.ptr = (void *)temp;
graphviz::attribute_state = NODE_A;
delete name;
;
break;}
case 35:
{ yyval.ptr=yyvsp[0].ptr; ;
break;}
case 36:
{
//consider port as a special properties ?? --need work here
std::string* name = static_cast<std::string*>(yyvsp[-2].ptr);
std::string* port = static_cast<std::string*>(yyvsp[0].ptr);
std::pair<graphviz::Iter, bool> result = graphviz::lookup(*name);
if (result.second)
graphviz::current_vertex = result.first->second;
else
graphviz::current_vertex = graphviz::add_name(*name, *static_cast<GRAPHVIZ_GRAPH*>(YYPARSE_PARAM)) ;
graphviz::Vertex* temp = new graphviz::Vertex(graphviz::current_vertex);
yyval.ptr = (void *)temp;
graphviz::attribute_state = NODE_A;
delete name;
delete port;
;
break;}
case 37:
{
typedef std::pair<void*, bool>* Ptr;
Ptr source = static_cast<Ptr>(yyvsp[-2].ptr);
for (std::vector<Ptr>::iterator it=graphviz::vlist.begin();
it !=graphviz::vlist.end(); ++it) {
if ( source->second ) {
if ( (*it)->second )
graphviz::add_edges(static_cast<graphviz::Subgraph*>(source->first),
static_cast<graphviz::Subgraph*>((*it)->first),
*static_cast<GRAPHVIZ_GRAPH*>(YYPARSE_PARAM));
else
graphviz::add_edges(static_cast<graphviz::Subgraph*>(source->first),
*static_cast<graphviz::Vertex*>((*it)->first),
*static_cast<GRAPHVIZ_GRAPH*>(YYPARSE_PARAM));
} else {
graphviz::Vertex* temp = static_cast<graphviz::Vertex*>(source->first);
if ( (*it)->second )
graphviz::add_edges(*temp,
static_cast<graphviz::Subgraph*>((*it)->first),
*static_cast<GRAPHVIZ_GRAPH*>(YYPARSE_PARAM));
else
graphviz::add_edges(*temp,
*static_cast<graphviz::Vertex*>((*it)->first),
*static_cast<GRAPHVIZ_GRAPH*>(YYPARSE_PARAM));
delete temp;
}
delete source;
source = *it;
}
if ( ! source->second ) {
graphviz::Vertex* temp = static_cast<graphviz::Vertex*>(source->first);
delete temp;
}
delete source;
graphviz::attributes.clear();
graphviz::vlist.clear();
;
break;}
case 38:
{ graphviz::vlist.push_back(static_cast<std::pair<void*, bool>*>(yyvsp[0].ptr)); ;
break;}
case 41:
{
std::pair<void*, bool>* temp = new std::pair<void*, bool>;
temp->first = yyvsp[0].ptr;
temp->second = false;
yyval.ptr = (void*)temp;
graphviz::attribute_state = EDGE_A;
;
break;}
case 42:
{
std::pair<void*, bool>* temp = new std::pair<void*, bool>;
temp->first = yyvsp[0].ptr;
temp->second = true;
yyval.ptr = (void*)temp;
graphviz::attribute_state = EDGE_A;
;
break;}
case 43:
{
if ( yyvsp[0].i )
graphviz::current_graph = &graphviz::current_graph->parent();
else
graphviz::current_graph = graphviz::previous_graph;
;
break;}
case 44:
{
graphviz::previous_graph = graphviz::current_graph;
std::string name = graphviz::random_string();
graphviz::Subgraph* temp = graphviz::create_subgraph(name);
graphviz::current_graph = temp;
graphviz::set_graph_name(name);
yyval.ptr = (void *) graphviz::current_graph;
;
break;}
case 45:
{
graphviz::current_graph = &graphviz::current_graph->parent();
;
break;}
case 46:
{
//lookup ID_T if it is already in the subgraph,
//if it is not, add a new subgraph
std::string* name = static_cast<std::string*>(yyvsp[0].ptr);
std::pair<graphviz::It, bool> temp = graphviz::lookup_subgraph(*name);
graphviz::previous_graph = graphviz::current_graph;
if ( temp.second ) {//found
graphviz::current_graph = (temp.first)->second;
} else {
graphviz::current_graph = graphviz::create_subgraph(*name);
graphviz::set_graph_name(*name);
}
yyval.ptr = (void *) graphviz::current_graph;
delete name;
;
break;}
case 47:
{yyval.i = 1; ;
break;}
case 48:
{ yyval.i = 0; ;
break;}
}
/* the action file gets copied in in place of this dollarsign */
yyvsp -= yylen;
yyssp -= yylen;
#ifdef YYLSP_NEEDED
yylsp -= yylen;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
*++yyvsp = yyval;
#ifdef YYLSP_NEEDED
yylsp++;
if (yylen == 0)
{
yylsp->first_line = yylloc.first_line;
yylsp->first_column = yylloc.first_column;
yylsp->last_line = (yylsp-1)->last_line;
yylsp->last_column = (yylsp-1)->last_column;
yylsp->text = 0;
}
else
{
yylsp->last_line = (yylsp+yylen-1)->last_line;
yylsp->last_column = (yylsp+yylen-1)->last_column;
}
#endif
/* Now "shift" the result of the reduction.
Determine what state that goes to,
based on the state we popped back to
and the rule number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTBASE];
goto yynewstate;
yyerrlab: /* here on detecting error */
if (! yyerrstatus)
/* If not already recovering from an error, report this error. */
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
int size = 0;
char *msg;
int x, count;
count = 0;
/* Start X at -yyn if nec to avoid negative indexes in yycheck. */
for (x = (yyn < 0 ? -yyn : 0);
x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
size += strlen(yytname[x]) + 15, count++;
msg = (char *) malloc(size + 15);
if (msg != 0)
{
strcpy(msg, "parse error");
if (count < 5)
{
count = 0;
for (x = (yyn < 0 ? -yyn : 0);
x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
{
strcat(msg, count == 0 ? ", expecting `" : " or `");
strcat(msg, yytname[x]);
strcat(msg, "'");
count++;
}
}
yyerror(msg);
free(msg);
}
else
yyerror ("parse error; also virtual memory exceeded");
}
else
#endif /* YYERROR_VERBOSE */
yyerror("parse error");
}
goto yyerrlab1;
yyerrlab1: /* here on error raised explicitly by an action */
if (yyerrstatus == 3)
{
/* if just tried and failed to reuse lookahead token after an error, discard it. */
/* return failure if at end of input */
if (yychar == YYEOF)
YYABORT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif
yychar = YYEMPTY;
}
/* Else will try to reuse lookahead token
after shifting the error token. */
yyerrstatus = 3; /* Each real token shifted decrements this */
goto yyerrhandle;
yyerrdefault: /* current state does not do anything special for the error token. */
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
if (yyn) goto yydefault;
#endif
yyerrpop: /* pop the current state because it cannot handle the error token */
if (yyssp == yyss) YYABORT;
yyvsp--;
yystate = *--yyssp;
#ifdef YYLSP_NEEDED
yylsp--;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "Error: state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
yyerrhandle:
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yyerrdefault;
yyn += YYTERROR;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
goto yyerrdefault;
yyn = yytable[yyn];
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrpop;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrpop;
if (yyn == YYFINAL)
YYACCEPT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting error token, ");
#endif
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
yystate = yyn;
goto yynewstate;
yyacceptlab:
/* YYACCEPT comes here. */
if (yyfree_stacks)
{
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
}
return 0;
yyabortlab:
/* YYABORT comes here. */
if (yyfree_stacks)
{
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
}
return 1;
}
namespace boost {
void read_graphviz(const std::string& filename, GRAPHVIZ_GRAPH& g) {
FILE* file = fopen(filename.c_str(), "r");
yyrestart(file);
void* in = static_cast<void*>(file);
yyparse(static_cast<void*>(&g));
}
void read_graphviz(FILE* file, GRAPHVIZ_GRAPH& g) {
void* in = static_cast<void*>(file);
yyrestart(file);
yyparse(static_cast<void*>(&g));
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -