📄 graphviz_graph_parser.cpp
字号:
/* A Bison parser, made from graphviz_parser.y
by GNU Bison version 1.28 */
#define YYBISON 1 /* Identify Bison output. */
#define yyparse bgl_undir_parse
#define bgl_undir_lex bgl_undir_lex
#define bgl_undir_error bgl_undir_error
#define bgl_undir_lval bgl_undir_lval
#define bgl_undir_char bgl_undir_char
#define bgl_undir_debug bgl_undir_debug
#define bgl_undir_nerrs bgl_undir_nerrs
#define GRAPH_T 257
#define NODE_T 258
#define EDGE_T 259
#define DIGRAPH_T 260
#define EDGEOP_T 261
#define SUBGRAPH_T 262
#define ID_T 263
#line 1 "graphviz_parser.y"
//=======================================================================
// Copyright 2001 University of Notre Dame.
// Author: Lie-Quan Lee
//
// This file is part of the Boost Graph Library
//
// You should have received a copy of the License Agreement for the
// Boost Graph Library along with the software; see the file LICENSE.
// If not, contact Office of Research, University of Notre Dame, Notre
// Dame, IN 46556.
//
// Permission to modify the code and to distribute modified code is
// granted, provided the text of this NOTICE is retained, a notice that
// the code was modified is included with the above COPYRIGHT NOTICE and
// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
// file is distributed with the modified code.
//
// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
// By way of example, but not limitation, Licensor MAKES NO
// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
// OR OTHER RIGHTS.
//=======================================================================
#include <iostream>
#include <fstream>
#include <string>
#include <map>
#include <vector>
#include <boost/config.hpp>
#include <boost/graph/graphviz.hpp>
#if defined BOOST_NO_STRINGSTREAM
//#include <strstream> //We cannot use it since there is a bug in strstream
#include <stdlib.h>
#else
#include <sstream>
#endif
#ifndef GRAPHVIZ_GRAPH
#error Need to define the GRAPHVIZ_GRAPH macro to either GraphvizGraph or GraphvizDigraph.
#endif
#define YYPARSE_PARAM g
#include "yystype.h"
extern void bgl_undir_error(char* str);
extern void bgl_undir_restart(FILE* str);
extern int bgl_undir_lex(YYSTYPE* lvalp);
enum AttrState {GRAPH_GRAPH_A, GRAPH_NODE_A, GRAPH_EDGE_A, NODE_A, EDGE_A};
using boost::GraphvizAttrList;
namespace graphviz {
typedef boost::graph_traits<GRAPHVIZ_GRAPH>::vertex_descriptor Vertex;
typedef boost::graph_traits<GRAPHVIZ_GRAPH>::edge_descriptor Edge;
typedef GRAPHVIZ_GRAPH Subgraph;
static Vertex current_vertex;
static Edge current_edge;
static Subgraph* current_graph = NULL;
static Subgraph* previous_graph = NULL;
static std::vector< std::pair<void*, bool>* > vlist;//store a list of rhs
static std::map<std::string,std::string> attributes;//store attributes temporarily
static AttrState attribute_state;
static std::map<std::string, Subgraph*> subgraphs; //store the names of subgraphs
static std::map<std::string, Vertex> nodes; //store the names of nodes
typedef std::map<std::string, Subgraph*>::iterator It;
typedef std::map<std::string, Vertex>::iterator Iter;
static const std::string& get_graph_name(const Subgraph& g) {
const boost::graph_property<Subgraph, boost::graph_name_t>::type&
name = boost::get_property(g, boost::graph_name);
return name;
}
static std::pair<Iter, bool> lookup(const std::string& name) {
//lookup in the top level
Iter it = nodes.find(name);
bool found = (it != nodes.end() );
return std::make_pair(it, found);
}
static Vertex add_name(const std::string& name, GRAPHVIZ_GRAPH& g) {
Vertex v = boost::add_vertex(*current_graph);
v = current_graph->local_to_global(v);
//set the label of vertex, it could be overwritten later.
boost::property_map<GRAPHVIZ_GRAPH, boost::vertex_attribute_t>::type
va = boost::get(boost::vertex_attribute, g);
va[v]["label"] = name;
//add v into the map so next time we will find it.
nodes[name] = v;
return v;
}
static std::pair<It, bool> lookup_subgraph(const std::string& name) {
It it = subgraphs.find(name);
bool found = (it != subgraphs.end() );
return std::make_pair(it, found);
}
static Subgraph* create_subgraph(const std::string& name) {
Subgraph* new_subgraph = &(current_graph->create_subgraph());
subgraphs[name] = new_subgraph;
return new_subgraph;
}
static void set_attribute(GraphvizAttrList& p,
const GraphvizAttrList& attr) {
GraphvizAttrList::const_iterator i, end;
for ( i=attr.begin(), end=attr.end(); i!=end; ++i)
p[i->first]=i->second;
}
static void set_attribute(Subgraph& g,
AttrState s, bool clear_attribute = true) {
typedef Subgraph Graph;
switch ( s ) {
case GRAPH_GRAPH_A:
{
boost::graph_property<Graph, boost::graph_graph_attribute_t>::type&
gga = boost::get_property(g, boost::graph_graph_attribute);
set_attribute(gga, attributes);
}
break;
case GRAPH_NODE_A:
{
boost::graph_property<Graph, boost::graph_vertex_attribute_t>::type&
gna = boost::get_property(g, boost::graph_vertex_attribute);
set_attribute(gna, attributes);
}
break;
case GRAPH_EDGE_A:
{
boost::graph_property<Graph, boost::graph_edge_attribute_t>::type&
gea = boost::get_property(g, boost::graph_edge_attribute);
set_attribute(gea, attributes);
}
break;
case NODE_A:
{
boost::property_map<Graph, boost::vertex_attribute_t>::type
va = boost::get(boost::vertex_attribute, g); //va[v]
set_attribute(va[current_vertex], attributes);
}
break;
case EDGE_A:
{
boost::property_map<Graph, boost::edge_attribute_t>::type
ea = boost::get(boost::edge_attribute, g); //ea[e]
set_attribute(ea[current_edge], attributes);
}
break;
}
if ( clear_attribute )
attributes.clear();
}
static void add_edges(const Vertex& u,
const Vertex& v, GRAPHVIZ_GRAPH& g) {
graphviz::current_edge = boost::add_edge(u, v, g).first;
graphviz::set_attribute(g, EDGE_A, false);
}
static void add_edges(Subgraph* G1, Subgraph* G2,
GRAPHVIZ_GRAPH& g) {
boost::graph_traits<Subgraph>::vertex_iterator i, j, m, n;
for ( boost::tie(i, j) = boost::vertices(*G1); i != j; ++i) {
for ( boost::tie(m, n) = boost::vertices(*G2); m != n; ++m) {
graphviz::add_edges(G1->local_to_global(*i),
G2->local_to_global(*m), g);
}
}
}
static void add_edges(Subgraph* G, const Vertex& v, GRAPHVIZ_GRAPH& g) {
boost::graph_traits<Subgraph>::vertex_iterator i, j;
for ( boost::tie(i, j) = boost::vertices(*G); i != j; ++i) {
graphviz::add_edges(G->local_to_global(*i), v, g);
}
}
static void add_edges(const Vertex& u, Subgraph* G, GRAPHVIZ_GRAPH& g) {
boost::graph_traits<Subgraph>::vertex_iterator i, j;
for ( boost::tie(i, j) = boost::vertices(*G); i != j; ++i) {
graphviz::add_edges(u, G->local_to_global(*i), g);
}
}
static std::string random_string() {
static int i=0;
#if defined BOOST_NO_STRINGSTREAM
//std::strstream out;
char buf[256];
sprintf(buf, "default%i\0", i);
++i;
return string(buf);
#else
std::stringstream out;
out << "default" << i;
++i;
return out.str();
#endif
}
static void set_graph_name(const std::string& name) {
boost::graph_property<Subgraph, boost::graph_name_t>::type&
gea = boost::get_property(*current_graph, boost::graph_name);
gea = name;
}
} //namespace detail {
#include <stdio.h>
#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif
#define YYFINAL 66
#define YYFLAG -32768
#define YYNTBASE 18
#define YYTRANSLATE(x) ((unsigned)(x) <= 263 ? yytranslate[x] : 45)
static const char yytranslate[] = { 0,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 16, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 17, 12, 2,
15, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
13, 2, 14, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 10, 2, 11, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 1, 3, 4, 5, 6,
7, 8, 9
};
#if YYDEBUG != 0
static const short yyprhs[] = { 0,
0, 3, 7, 10, 12, 14, 16, 17, 20, 22,
24, 25, 28, 31, 36, 38, 40, 42, 44, 48,
52, 54, 56, 57, 59, 61, 63, 65, 67, 70,
74, 75, 77, 79, 83, 87, 90, 92, 95, 97,
99, 102, 103, 106, 109, 111
};
static const short yyrhs[] = { 20,
19, 0, 10, 23, 11, 0, 21, 22, 0, 3,
0, 6, 0, 9, 0, 0, 23, 25, 0, 25,
0, 12, 0, 0, 26, 24, 0, 31, 24, 0,
27, 13, 28, 14, 0, 3, 0, 4, 0, 5,
0, 29, 0, 28, 30, 29, 0, 9, 15, 9,
0, 12, 0, 16, 0, 0, 33, 0, 37, 0,
32, 0, 41, 0, 29, 0, 35, 34, 0, 13,
28, 14, 0, 0, 9, 0, 36, 0, 9, 17,
9, 0, 40, 39, 34, 0, 7, 40, 0, 38,
0, 39, 38, 0, 35, 0, 41, 0, 43, 44,
0, 0, 42, 19, 0, 8, 9, 0, 19, 0,
0
};
#endif
#if YYDEBUG != 0
static const short yyrline[] = { 0,
246, 249, 252, 262, 262, 265, 265, 268, 268, 271,
271, 274, 274, 278, 285, 286, 287, 290, 290, 293,
303, 303, 303, 306, 306, 306, 306, 309, 317, 328,
328, 331, 346, 349, 368, 413, 417, 417, 420, 429,
440, 447, 457, 462, 483, 483
};
#endif
#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
static const char * const yytname[] = { "$","error","$undefined.","GRAPH_T",
"NODE_T","EDGE_T","DIGRAPH_T","EDGEOP_T","SUBGRAPH_T","ID_T","'{'","'}'","';'",
"'['","']'","'='","','","':'","graph","graph_body","graph_header","graph_type",
"graph_name","stmt_list","semicolon","stmt","attr_stmt","attr_header","attr_list",
"attr","attr_separator","compound_stmt","graph_attr","node_stmt","opt_attr",
"node_id","node_port","edge_stmt","edge_rhs_one","edge_rhs","edge_endpoint",
"subgraph","@1","subgraph_header","opt_graph_body", NULL
};
#endif
static const short yyr1[] = { 0,
18, 19, 20, 21, 21, 22, 22, 23, 23, 24,
24, 25, 25, 26, 27, 27, 27, 28, 28, 29,
30, 30, 30, 31, 31, 31, 31, 32, 33, 34,
34, 35, 35, 36, 37, 38, 39, 39, 40, 40,
41, 42, 41, 43, 44, 44
};
static const short yyr2[] = { 0,
2, 3, 2, 1, 1, 1, 0, 2, 1, 1,
0, 2, 2, 4, 1, 1, 1, 1, 3, 3,
1, 1, 0, 1, 1, 1, 1, 1, 2, 3,
0, 1, 1, 3, 3, 2, 1, 2, 1, 1,
2, 0, 2, 2, 1, 0
};
static const short yydefact[] = { 0,
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -