Gaudi Framework, version v23r6
Home   Generated: Wed Jan 30 2013
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
Grammar.h
Go to the documentation of this file.
1 #ifndef JOBOPTIONSVC_GRAMMAR_H_
2 #define JOBOPTIONSVC_GRAMMAR_H_
3 // ============================================================================
4 // Includes:
5 // ============================================================================
6 // STD & STL:
7 // ============================================================================
8 #include <string>
9 #include <vector>
10 #include <map>
11 // ============================================================================
12 // Boost:
13 // ============================================================================
14 #include <boost/spirit/include/qi.hpp>
15 #include <boost/spirit/include/phoenix_core.hpp>
16 #include <boost/spirit/include/phoenix_fusion.hpp>
17 #include <boost/spirit/include/phoenix_operator.hpp>
18 #include <boost/spirit/include/phoenix_stl.hpp>
19 #include <boost/spirit/repository/include/qi_confix.hpp>
20 
21 #if BOOST_VERSION <= 104400
22 #include "iter_pos.hpp"
23 #else
24 #include <boost/spirit/repository/include/qi_iter_pos.hpp>
25 #endif
26 
27 // ============================================================================
28 // Project:
29 // ============================================================================
30 #include "Node.h"
31 //============================================================================
32 namespace Gaudi { namespace Parsers {
33 // ============================================================================
34 // Namespace aliases:
35 // ============================================================================
36 namespace sp = boost::spirit;
37 namespace ph = boost::phoenix;
38 namespace qi = sp::qi;
39 namespace enc = sp::ascii;
40 namespace rep = sp::repository;
41 //=============================================================================
42 // Grammars
43 //=============================================================================
44 template<typename Iterator>
45 struct SkipperGrammar: qi::grammar<Iterator> {
46  SkipperGrammar() : SkipperGrammar::base_type(comments) {
47  comments = enc::space
48  | rep::confix("/*", "*/")[*(qi::char_ - "*/")]
49  | rep::confix("//", (sp::eol | sp::eoi))[*(qi::char_ - (sp::eol | sp::eoi))];
50  }
51  qi::rule<Iterator> comments;
52 };
53 // ============================================================================
54 template<typename Iterator, typename Skipper>
55 struct StringGrammar: qi::grammar<Iterator, std::string(), qi::locals<char>,
56  Skipper> {
57  //---------------------------------------------------------------------------
58  typedef std::string ResultT;
59  //---------------------------------------------------------------------
60  StringGrammar() : StringGrammar::base_type(str) {
61  begin_quote = enc::char_("\"'");
62  quote = enc::char_(qi::_r1);
63 
64  str = qi::lexeme[begin_quote[qi::_a = qi::_1] >> *((enc::char_('\\')
65  >> quote(qi::_a))[qi::_val += qi::_a]
66  | (enc::char_[qi::_val += qi::_1] - quote(qi::_a)))
67  >> quote(qi::_a)];
68  }
69 //-----------------------------------------------------------------------------
70  qi::rule<Iterator, std::string(), qi::locals<char>, Skipper> str;
71  qi::rule<Iterator, char()> begin_quote;
72  qi::rule<Iterator, void(char)> quote;
73 //-----------------------------------------------------------------------------
74 };
75 // ============================================================================
76 template<typename Iterator, typename Skipper>
77 struct IdentifierGrammar: qi::grammar<Iterator, Node(), Skipper> {
78 //-----------------------------------------------------------------------------
79  typedef std::string ResultT;
80 //-----------------------------------------------------------------------------
81  IdentifierGrammar() : IdentifierGrammar::base_type(ident) {
82  ident = rep::qi::iter_pos[op(qi::_val, qi::_1)] >> str[op(qi::_val, qi::_1)][op(qi::_val, Node::kIdentifier)];
83  str = -qi::lit("::")[qi::_val += "::"] >> inner[qi::_val += qi::_1]
84  >> *(qi::lit("::") >> inner[qi::_val += ("::"+qi::_1)]);
85  inner = qi::alpha >> *(qi::alnum | qi::char_('_'));
86  }
87 // ----------------------------------------------------------------------------
88  qi::rule<Iterator, Node(), Skipper> ident;
89  qi::rule<Iterator, std::string(), Skipper> str;
90  qi::rule<Iterator, std::string()> inner;
91  ph::function<NodeOperations> op;
92 };
93 // ============================================================================
94 template<typename Iterator, typename Skipper>
95 struct BoolGrammar: qi::grammar<Iterator, bool(), Skipper> {
96 // ----------------------------------------------------------------------------
97  typedef bool ResultT;
98 // ----------------------------------------------------------------------------
99  BoolGrammar() : BoolGrammar::base_type(boolean) {
100  boolean = enc::no_case[
101  qi::lit("true")[qi::_val=true]
102  |
103  qi::lit("false")[qi::_val=false]
104  ];
105  }
106 // ----------------------------------------------------------------------------
107  qi::rule<Iterator, bool(), Skipper> boolean;
108 };
109 // ============================================================================
110 template<typename Iterator, typename Skipper>
111 struct RealGrammar: qi::grammar<Iterator, Node(), Skipper> {
112 // ----------------------------------------------------------------------------
113  typedef bool ResultT;
114 //---------------------------------------------------------------------
115  RealGrammar() : RealGrammar::base_type(real) {
116  real = qi::raw[qi::double_][op(qi::_val, qi::_1)]
117  [op(qi::_val, Node::kReal)]
118  >> -(-qi::char_('*') >> gunit[op(qi::_val,qi::_1)]);
119 
120  }
121 // ----------------------------------------------------------------------------
122  qi::rule<Iterator, Node(), Skipper> real;
123  IdentifierGrammar<Iterator,Skipper> gunit;
124  ph::function<NodeOperations> op;
125 };
126 // ============================================================================
127 template<typename Iterator, typename Skipper>
128 struct UnitsGrammar: qi::grammar<Iterator, Node(), Skipper> {
129 // ----------------------------------------------------------------------------
130  UnitsGrammar() : UnitsGrammar::base_type(units) {
131  units = *unit[op(qi::_val, qi::_1)];
132  unit = rep::qi::iter_pos[op(qi::_val, qi::_1)] >>
133  val[op(qi::_val, qi::_1)]
134  >> -qi::lit('*') >> gunit[op(qi::_val, qi::_1)]
135  >> qi::lit('=') >> val[op(qi::_val, qi::_1)]
136  [op(qi::_val, Node::kUnit)];;
137  val = qi::raw[qi::double_]
138  [op(qi::_val, qi::_1)][op(qi::_val, Node::kReal)];
139 
140  }
141 // ----------------------------------------------------------------------------
142  qi::rule<Iterator, Node(), Skipper> units, unit, val;
143  IdentifierGrammar<Iterator,Skipper> gunit;
144  ph::function<NodeOperations> op;
145 };
146 // ============================================================================
147 template<typename Iterator, typename Skipper>
148 struct FileGrammar: qi::grammar<Iterator, Node(), Skipper> {
149  FileGrammar() : FileGrammar::base_type(file) {
150  file = -shell[op(qi::_val,qi::_1)] >>
151  *(statement[op(qi::_val, qi::_1)])
152  [op(qi::_val, Node::kRoot)];
153  shell = rep::confix("#!", qi::eol)[*(qi::char_[qi::_a += qi::_1]
154  - qi::eol)][op(qi::_val,Node::kShell)]
155  [op(qi::_val,qi::_a)];
156  statement = rep::qi::iter_pos[qi::_a = qi::_1]
157  >> (include | assign | units | print_options | pragma
158  | condition)[qi::_val = qi::_1][op(qi::_val,qi::_a)];
159  condition = (qi::lit("#ifdef")[op(qi::_a,Node::kIfdef)]
160  | qi::lit("#ifndef")[op(qi::_a,Node::kIfndef)])
161  >> property[op(qi::_val,qi::_1)]
162  >> (*statement[op(qi::_a,qi::_1)])[op(qi::_val, qi::_a)]
163  >> -(qi::lit("#else")[op(qi::_b,Node::kElse)]
164  >> *statement[op(qi::_b,qi::_1)])[op(qi::_val,qi::_b)]
165  >> qi::lit("#endif")[op(qi::_val, Node::kCondition)];
166  include = qi::lit("#include")
167  >> gstring[op(qi::_val, qi::_1)]
168  [op(qi::_val, Node::kInclude)];
169  units = qi::lit("#units")
170  >> gstring[op(qi::_val, qi::_1)]
171  [op(qi::_val, Node::kUnits)];
172  print_options = qi::lit("#printOptions") >> qi::lit("full")
173  [op(qi::_val, Node::kPrintOptions)];
174  pragma = qi::lit("#pragma") >> (pragma_print | pragma_tree |
175  pragma_dump_file);
176  pragma_print = qi::lit("print") >> enc::no_case[
177  qi::lit("on")[op(qi::_val, Node::kPrintOn)]
178  | qi::lit("off")[op(qi::_val, Node::kPrintOff)]
179  ];
180  pragma_tree = enc::no_case[
181  qi::lit("printtree")[op(qi::_val, Node::kPrintTree)]
182  ];
183  pragma_dump_file = qi::lit("dumpfile") >> gstring[op(qi::_val, qi::_1)]
184  [op(qi::_val, Node::kDumpFile)];
185  assign = property[op(qi::_val, qi::_1)]
186  [op(qi::_val, Node::kAssign)]
187  >> oper[op(qi::_val, qi::_1)]
188  >> value[op(qi::_val, qi::_1)]
189  >> ';';
190  property = rep::qi::iter_pos[op(qi::_val, qi::_1)]
191  >> (gidentifier[op(qi::_val, qi::_1)] % '.')
192  [op(qi::_val, Node::kProperty)];
193  property_ref %= -qi::lit('@') >>
194  property[op(qi::_val, Node::kPropertyRef)];
195  oper = rep::qi::iter_pos[op(qi::_val, qi::_1)]
196  >> (qi::lit("=")[op(qi::_val, Node::kEqual)]
197  |
198  qi::lit("+=")[op(qi::_val, Node::kPlusEqual)]
199  |
200  qi::lit("-=")[op(qi::_val, Node::kMinusEqual)]);
201  value = rep::qi::iter_pos[qi::_a = qi::_1]
202  >>
203  (map_value | vector_value | simple_value | property |
204  property_ref)
205  [qi::_val = qi::_1][op(qi::_val, qi::_a)]
206  ;
207  begin_vector = enc::char_('(')[qi::_val=')']
208  |
209  enc::char_('[')[qi::_val=']']
210  |
211  enc::char_('{')[qi::_val='}'];
212  end_vector = qi::char_(qi::_r1);
213  vector_value = (begin_vector[qi::_a = qi::_1]
214  >> -(value[op(qi::_val,qi::_1)] % ',')
215  >> end_vector(qi::_a)
216  )[op(qi::_val,Node::kVector)];
217  map_value = (enc::char_('{')
218  >> -(pair[op(qi::_val, qi::_1)] % ',')
219  >> enc::char_('}'))
220  [op(qi::_val, Node::kMap)];
221  pair = simple_value[op(qi::_val,qi::_1)] >> ':'
222  >> value[op(qi::_val,qi::_1)]
223  [op(qi::_val,Node::kPair)];
224  simple_value =
225  (gstring[op(qi::_val, qi::_1)][op(qi::_val, Node::kString)])
226  |
227  (gbool[op(qi::_val, qi::_1)][op(qi::_val, Node::kBool)])
228  |
229  (greal[qi::_val = qi::_1]);
230  }
231  qi::rule<Iterator, Node(), Skipper> file, include, assign, property,
232  property_ref, oper, map_value, pair_value, simple_value, pair, units,
233  print_options, pragma, pragma_print, pragma_tree, pragma_dump_file;
234  qi::rule<Iterator, Node(),qi::locals<std::string> > shell;
235  qi::rule<Iterator, Node(), qi::locals<Iterator>, Skipper> statement, value;
236  qi::rule<Iterator, Node(), qi::locals<char>, Skipper> vector_value;
237  qi::rule<Iterator, Node(), qi::locals<Node, Node>, Skipper> condition;
238  qi::rule<Iterator, char()> begin_vector;
239  qi::rule<Iterator, void(char)> end_vector;
240  StringGrammar<Iterator, Skipper> gstring;
241  BoolGrammar<Iterator, Skipper> gbool;
242  RealGrammar<Iterator, Skipper> greal;
243  IdentifierGrammar<Iterator, Skipper> gidentifier;
244  ph::function<NodeOperations> op;
245 };
246 // ============================================================================
247 } /* Gaudi */ } /* Parsers */
248 // ============================================================================
249 #endif // JOBOPTIONSVC_GRAMMAR_H_
Generated at Wed Jan 30 2013 17:13:38 for Gaudi Framework, version v23r6 by Doxygen version 1.8.2 written by Dimitri van Heesch, © 1997-2004