2 * This C source file was generated by $ANTLR version 3.2 Sep 23, 2009 12:02:23
\r
4 * - From the grammar source file : C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g
\r
5 * - On : 2010-03-26 13:33:28
\r
6 * - for the lexer : SimanticsDataLexerLexer *
\r
7 * Editing it, at least manually, is not wise.
\r
9 * C language generator and runtime by Jim Idle, jimi|hereisanat|idle|dotgoeshere|ws.
\r
13 // [The "BSD licence"]
\r
14 // Copyright (c) 2005-2009 Jim Idle, Temporal Wave LLC
\r
15 // http://www.temporal-wave.com
\r
16 // http://www.linkedin.com/in/jimidle
\r
18 // All rights reserved.
\r
20 // Redistribution and use in source and binary forms, with or without
\r
21 // modification, are permitted provided that the following conditions
\r
23 // 1. Redistributions of source code must retain the above copyright
\r
24 // notice, this list of conditions and the following disclaimer.
\r
25 // 2. Redistributions in binary form must reproduce the above copyright
\r
26 // notice, this list of conditions and the following disclaimer in the
\r
27 // documentation and/or other materials provided with the distribution.
\r
28 // 3. The name of the author may not be used to endorse or promote products
\r
29 // derived from this software without specific prior written permission.
\r
31 // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
\r
32 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
\r
33 // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
\r
34 // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
\r
35 // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
\r
36 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
\r
37 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
\r
38 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
\r
39 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
\r
40 // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
\r
42 /* -----------------------------------------
\r
43 * Include the ANTLR3 generated header file.
\r
45 #include "SimanticsDataLexer.h"
\r
46 /* ----------------------------------------- */
\r
49 /** String literals used by SimanticsDataLexer that we must do things like MATCHS() with.
\r
50 * C will normally just lay down 8 bit characters, and you can use L"xxx" to
\r
51 * get wchar_t, but wchar_t is 16 bits on Windows, which is not UTF32 and so
\r
52 * we perform this little trick of defining the literals as arrays of UINT32
\r
53 * and passing in the address of these.
\r
55 static ANTLR3_UCHAR lit_1[] = { 0x74, 0x79, 0x70, 0x65, ANTLR3_STRING_TERMINATOR};
\r
56 static ANTLR3_UCHAR lit_2[] = { 0x2E, 0x2E, ANTLR3_STRING_TERMINATOR};
\r
57 static ANTLR3_UCHAR lit_3[] = { 0x74, 0x72, 0x75, 0x65, ANTLR3_STRING_TERMINATOR};
\r
58 static ANTLR3_UCHAR lit_4[] = { 0x66, 0x61, 0x6C, 0x73, 0x65, ANTLR3_STRING_TERMINATOR};
\r
59 static ANTLR3_UCHAR lit_5[] = { 0x6E, 0x75, 0x6C, 0x6C, ANTLR3_STRING_TERMINATOR};
\r
60 static ANTLR3_UCHAR lit_6[] = { 0x6D, 0x61, 0x70, ANTLR3_STRING_TERMINATOR};
\r
61 static ANTLR3_UCHAR lit_7[] = { 0x2F, 0x2F, ANTLR3_STRING_TERMINATOR};
\r
62 static ANTLR3_UCHAR lit_8[] = { 0x2F, 0x2A, ANTLR3_STRING_TERMINATOR};
\r
63 static ANTLR3_UCHAR lit_9[] = { 0x2A, 0x2F, ANTLR3_STRING_TERMINATOR};
\r
64 static ANTLR3_UCHAR lit_10[] = { 0x22, 0x22, 0x22, ANTLR3_STRING_TERMINATOR};
\r
65 static ANTLR3_UCHAR lit_11[] = { 0x22, 0x22, ANTLR3_STRING_TERMINATOR};
\r
70 /* MACROS that hide the C interface implementations from the
\r
71 * generated code, which makes it a little more understandable to the human eye.
\r
72 * I am very much against using C pre-processor macros for function calls and bits
\r
73 * of code as you cannot see what is happening when single stepping in debuggers
\r
74 * and so on. The exception (in my book at least) is for generated code, where you are
\r
75 * not maintaining it, but may wish to read and understand it. If you single step it, you know that input()
\r
76 * hides some indirect calls, but is always referring to the input stream. This is
\r
77 * probably more readable than ctx->input->istream->input(snarfle0->blarg) and allows me to rejig
\r
78 * the runtime interfaces without changing the generated code too often, without
\r
79 * confusing the reader of the generated output, who may not wish to know the gory
\r
80 * details of the interface inheritance.
\r
85 /* Aids in accessing scopes for grammar programmers
\r
90 #define SCOPE_TYPE(scope) pSimanticsDataLexer_##scope##_SCOPE
\r
91 #define SCOPE_STACK(scope) pSimanticsDataLexer_##scope##Stack
\r
92 #define SCOPE_TOP(scope) ctx->pSimanticsDataLexer_##scope##Top
\r
93 #define SCOPE_SIZE(scope) ctx->pSimanticsDataLexer_##scope##Stack_limit
\r
94 #define SCOPE_INSTANCE(scope, i) (ctx->SCOPE_STACK(scope)->get(ctx->SCOPE_STACK(scope),i))
\r
97 /* Macros for accessing things in a lexer
\r
102 #undef GETCHARINDEX
\r
104 #undef GETCHARPOSITIONINLINE
\r
116 #undef HASEXCEPTION
\r
124 #undef BACKTRACKING
\r
127 #undef HAVEPARSEDRULE
\r
136 #define LEXER ctx->pLexer
\r
137 #define RECOGNIZER LEXER->rec
\r
138 #define LEXSTATE RECOGNIZER->state
\r
139 #define TOKSOURCE LEXSTATE->tokSource
\r
140 #define GETCHARINDEX() LEXER->getCharIndex(LEXER)
\r
141 #define GETLINE() LEXER->getLine(LEXER)
\r
142 #define GETTEXT() LEXER->getText(LEXER)
\r
143 #define GETCHARPOSITIONINLINE() LEXER->getCharPositionInLine(LEXER)
\r
144 #define EMIT() LEXSTATE->type = _type; LEXER->emit(LEXER)
\r
145 #define EMITNEW(t) LEXER->emitNew(LEXER, t)
\r
146 #define MATCHC(c) LEXER->matchc(LEXER, c)
\r
147 #define MATCHS(s) LEXER->matchs(LEXER, s)
\r
148 #define MATCHRANGE(c1,c2) LEXER->matchRange(LEXER, c1, c2)
\r
149 #define MATCHANY() LEXER->matchAny(LEXER)
\r
150 #define LTOKEN LEXSTATE->token
\r
151 #define HASFAILED() (LEXSTATE->failed == ANTLR3_TRUE)
\r
152 #define BACKTRACKING LEXSTATE->backtracking
\r
153 #define FAILEDFLAG LEXSTATE->failed
\r
154 #define INPUT LEXER->input
\r
155 #define STRSTREAM INPUT
\r
156 #define ISTREAM INPUT->istream
\r
157 #define INDEX() ISTREAM->index(ISTREAM)
\r
158 #define SEEK(n) ISTREAM->seek(ISTREAM, n)
\r
159 #define EOF_TOKEN &(LEXSTATE->tokSource->eofToken)
\r
160 #define HASEXCEPTION() (LEXSTATE->error == ANTLR3_TRUE)
\r
161 #define EXCEPTION LEXSTATE->exception
\r
162 #define CONSTRUCTEX() RECOGNIZER->exConstruct(RECOGNIZER)
\r
163 #define LRECOVER() LEXER->recover(LEXER)
\r
164 #define MARK() ISTREAM->mark(ISTREAM)
\r
165 #define REWIND(m) ISTREAM->rewind(ISTREAM, m)
\r
166 #define REWINDLAST() ISTREAM->rewindLast(ISTREAM)
\r
167 #define MEMOIZE(ri,si) RECOGNIZER->memoize(RECOGNIZER, ri, si)
\r
168 #define HAVEPARSEDRULE(r) RECOGNIZER->alreadyParsedRule(RECOGNIZER, r)
\r
169 #define PUSHSTREAM(str) LEXER->pushCharStream(LEXER, str)
\r
170 #define POPSTREAM() LEXER->popCharStream(LEXER)
\r
171 #define SETTEXT(str) LEXSTATE->text = str
\r
172 #define SKIP() LEXSTATE->token = &(TOKSOURCE->skipToken)
\r
173 #define USER1 LEXSTATE->user1
\r
174 #define USER2 LEXSTATE->user2
\r
175 #define USER3 LEXSTATE->user3
\r
176 #define CUSTOM LEXSTATE->custom
\r
177 #define RULEMEMO LEXSTATE->ruleMemo
\r
178 #define DBG RECOGNIZER->debugger
\r
180 /* If we have been told we can rely on the standard 8 bit or 16 bit input
\r
181 * stream, then we can define our macros to use the direct pointers
\r
182 * in the input object, which is much faster than indirect calls. This
\r
183 * is really only significant to lexers with a lot of fragment rules (which
\r
184 * do not place LA(1) in a temporary at the moment) and even then
\r
185 * only if there is a lot of input (order of say 1M or so).
\r
187 #if defined(ANTLR3_INLINE_INPUT_ASCII) || defined(ANTLR3_INLINE_INPUT_UTF16)
\r
189 # ifdef ANTLR3_INLINE_INPUT_ASCII
\r
191 /* 8 bit "ASCII" (actually any 8 bit character set) */
\r
193 # define NEXTCHAR ((pANTLR3_UINT8)(INPUT->nextChar))
\r
194 # define DATAP ((pANTLR3_UINT8)(INPUT->data))
\r
198 # define NEXTCHAR ((pANTLR3_UINT16)(INPUT->nextChar))
\r
199 # define DATAP ((pANTLR3_UINT16)(INPUT->data))
\r
203 # define LA(n) ((NEXTCHAR + n) > (DATAP + INPUT->sizeBuf) ? ANTLR3_CHARSTREAM_EOF : (ANTLR3_UCHAR)(*(NEXTCHAR + n - 1)))
\r
204 # define CONSUME() \
\r
206 if (NEXTCHAR < (DATAP + INPUT->sizeBuf)) \
\r
208 INPUT->charPositionInLine++; \
\r
209 if ((ANTLR3_UCHAR)(*NEXTCHAR) == INPUT->newlineChar) \
\r
212 INPUT->charPositionInLine = 0; \
\r
213 INPUT->currentLine = (void *)(NEXTCHAR + 1); \
\r
215 INPUT->nextChar = (void *)(NEXTCHAR + 1); \
\r
221 // Pick up the input character by calling the input stream implementation.
\r
223 #define CONSUME() INPUT->istream->consume(INPUT->istream)
\r
224 #define LA(n) INPUT->istream->_LA(INPUT->istream, n)
\r
227 #define TOKTEXT(tok, txt) tok, (pANTLR3_UINT8)txt
\r
229 /* The 4 tokens defined below may well clash with your own #defines or token types. If so
\r
230 * then for the present you must use different names for your defines as these are hard coded
\r
231 * in the code generator. It would be better not to use such names internally, and maybe
\r
232 * we can change this in a forthcoming release. I deliberately do not #undef these
\r
233 * here as this will at least give you a redefined error somewhere if they clash.
\r
235 #define UP ANTLR3_TOKEN_UP
\r
236 #define DOWN ANTLR3_TOKEN_DOWN
\r
237 #define EOR ANTLR3_TOKEN_EOR
\r
238 #define INVALID ANTLR3_TOKEN_INVALID
\r
241 /* =============================================================================
\r
242 * Functions to create and destroy scopes. First come the rule scopes, followed
\r
243 * by the global declared scopes.
\r
248 /* ============================================================================= */
\r
250 /* =============================================================================
\r
251 * Start of recognizer
\r
255 /* Forward declare the locally static matching functions we have generated and any predicate functions.
\r
257 static ANTLR3_INLINE void mT__34 (pSimanticsDataLexer ctx);
\r
258 static ANTLR3_INLINE void mT__35 (pSimanticsDataLexer ctx);
\r
259 static ANTLR3_INLINE void mT__36 (pSimanticsDataLexer ctx);
\r
260 static ANTLR3_INLINE void mT__37 (pSimanticsDataLexer ctx);
\r
261 static ANTLR3_INLINE void mT__38 (pSimanticsDataLexer ctx);
\r
262 static ANTLR3_INLINE void mT__39 (pSimanticsDataLexer ctx);
\r
263 static ANTLR3_INLINE void mT__40 (pSimanticsDataLexer ctx);
\r
264 static ANTLR3_INLINE void mT__41 (pSimanticsDataLexer ctx);
\r
265 static ANTLR3_INLINE void mT__42 (pSimanticsDataLexer ctx);
\r
266 static ANTLR3_INLINE void mT__43 (pSimanticsDataLexer ctx);
\r
267 static ANTLR3_INLINE void mT__44 (pSimanticsDataLexer ctx);
\r
268 static ANTLR3_INLINE void mT__45 (pSimanticsDataLexer ctx);
\r
269 static ANTLR3_INLINE void mT__46 (pSimanticsDataLexer ctx);
\r
270 static ANTLR3_INLINE void mT__47 (pSimanticsDataLexer ctx);
\r
271 static ANTLR3_INLINE void mT__48 (pSimanticsDataLexer ctx);
\r
272 static ANTLR3_INLINE void mT__49 (pSimanticsDataLexer ctx);
\r
273 static ANTLR3_INLINE void mID (pSimanticsDataLexer ctx);
\r
274 static ANTLR3_INLINE void mINT (pSimanticsDataLexer ctx);
\r
275 static ANTLR3_INLINE void mFLOAT (pSimanticsDataLexer ctx);
\r
276 static ANTLR3_INLINE void mCOMMENT (pSimanticsDataLexer ctx);
\r
277 static ANTLR3_INLINE void mWS (pSimanticsDataLexer ctx);
\r
278 static ANTLR3_INLINE void mSTRING (pSimanticsDataLexer ctx);
\r
279 static ANTLR3_INLINE void mEXPONENT (pSimanticsDataLexer ctx);
\r
280 static ANTLR3_INLINE void mHEX_DIGIT (pSimanticsDataLexer ctx);
\r
281 static ANTLR3_INLINE void mESC_SEQ (pSimanticsDataLexer ctx);
\r
282 static ANTLR3_INLINE void mOCTAL_ESC (pSimanticsDataLexer ctx);
\r
283 static ANTLR3_INLINE void mUNICODE_ESC (pSimanticsDataLexer ctx);
\r
284 static ANTLR3_INLINE void mTokens (pSimanticsDataLexer ctx);
\r
285 static void SimanticsDataLexerFree(pSimanticsDataLexer ctx);
\r
287 /* =========================================================================
\r
288 * Lexer matching rules end.
\r
289 * =========================================================================
\r
295 SimanticsDataLexerFree (pSimanticsDataLexer ctx)
\r
297 LEXER->free(LEXER);
\r
302 /** \brief Name of the grammar file that generated this code
\r
304 static const char fileName[] = "C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g";
\r
306 /** \brief Return the name of the grammar file that generated this code.
\r
308 static const char * getGrammarFileName()
\r
313 /** \brief Create a new lexer called SimanticsDataLexer
\r
315 * \param[in] instream Pointer to an initialized input stream
\r
317 * - Success pSimanticsDataLexer initialized for the lex start
\r
320 ANTLR3_API pSimanticsDataLexer SimanticsDataLexerNew
\r
321 (pANTLR3_INPUT_STREAM instream)
\r
323 // See if we can create a new lexer with the standard constructor
\r
325 return SimanticsDataLexerNewSSD(instream, NULL);
\r
328 /** \brief Create a new lexer called SimanticsDataLexer
\r
330 * \param[in] instream Pointer to an initialized input stream
\r
331 * \param[state] state Previously created shared recognizer stat
\r
333 * - Success pSimanticsDataLexer initialized for the lex start
\r
336 ANTLR3_API pSimanticsDataLexer SimanticsDataLexerNewSSD
\r
337 (pANTLR3_INPUT_STREAM instream, pANTLR3_RECOGNIZER_SHARED_STATE state)
\r
339 pSimanticsDataLexer ctx; // Context structure we will build and return
\r
341 ctx = (pSimanticsDataLexer) ANTLR3_CALLOC(1, sizeof(SimanticsDataLexer));
\r
345 // Failed to allocate memory for lexer context
\r
349 /* -------------------------------------------------------------------
\r
350 * Memory for basic structure is allocated, now to fill in
\r
351 * in base ANTLR3 structures. We initialize the function pointers
\r
352 * for the standard ANTLR3 lexer function set, but upon return
\r
353 * from here, the programmer may set the pointers to provide custom
\r
354 * implementations of each function.
\r
356 * We don't use the macros defined in SimanticsDataLexer.h here so you can get a sense
\r
357 * of what goes where.
\r
360 /* Create a base lexer, using the supplied input stream
\r
362 ctx->pLexer = antlr3LexerNewStream(ANTLR3_SIZE_HINT, instream, state);
\r
364 /* Check that we allocated the memory correctly
\r
366 if (ctx->pLexer == NULL)
\r
371 /* Install the implementation of our SimanticsDataLexer interface
\r
373 ctx->mT__34 = mT__34;
\r
374 ctx->mT__35 = mT__35;
\r
375 ctx->mT__36 = mT__36;
\r
376 ctx->mT__37 = mT__37;
\r
377 ctx->mT__38 = mT__38;
\r
378 ctx->mT__39 = mT__39;
\r
379 ctx->mT__40 = mT__40;
\r
380 ctx->mT__41 = mT__41;
\r
381 ctx->mT__42 = mT__42;
\r
382 ctx->mT__43 = mT__43;
\r
383 ctx->mT__44 = mT__44;
\r
384 ctx->mT__45 = mT__45;
\r
385 ctx->mT__46 = mT__46;
\r
386 ctx->mT__47 = mT__47;
\r
387 ctx->mT__48 = mT__48;
\r
388 ctx->mT__49 = mT__49;
\r
391 ctx->mFLOAT = mFLOAT;
\r
392 ctx->mCOMMENT = mCOMMENT;
\r
394 ctx->mSTRING = mSTRING;
\r
395 ctx->mEXPONENT = mEXPONENT;
\r
396 ctx->mHEX_DIGIT = mHEX_DIGIT;
\r
397 ctx->mESC_SEQ = mESC_SEQ;
\r
398 ctx->mOCTAL_ESC = mOCTAL_ESC;
\r
399 ctx->mUNICODE_ESC = mUNICODE_ESC;
\r
400 ctx->mTokens = mTokens;
\r
402 /** When the nextToken() call is made to this lexer's pANTLR3_TOKEN_SOURCE
\r
403 * it will call mTokens() in this generated code, and will pass it the ctx
\r
404 * pointer of this lexer, not the context of the base lexer, so store that now.
\r
406 ctx->pLexer->ctx = ctx;
\r
408 /**Install the token matching function
\r
410 ctx->pLexer->mTokens = (void (*) (void *))(mTokens);
\r
412 ctx->getGrammarFileName = getGrammarFileName;
\r
413 ctx->free = SimanticsDataLexerFree;
\r
419 /* Return the newly built lexer to the caller
\r
424 /* =========================================================================
\r
425 * DFA tables for the lexer
\r
427 /** Static dfa state tables for Cyclic dfa:
\r
428 * 40:1: FLOAT : ( ( '-' )? ( '0' .. '9' )+ '.' ( '0' .. '9' )+ ( EXPONENT )? | ( '-' )? ( '0' .. '9' )+ EXPONENT );
\r
430 static const ANTLR3_INT32 dfa10_eot[5] =
\r
434 static const ANTLR3_INT32 dfa10_eof[5] =
\r
438 static const ANTLR3_INT32 dfa10_min[5] =
\r
442 static const ANTLR3_INT32 dfa10_max[5] =
\r
444 57, 57, 101, -1, -1
\r
446 static const ANTLR3_INT32 dfa10_accept[5] =
\r
450 static const ANTLR3_INT32 dfa10_special[5] =
\r
455 /** Used when there is no transition table entry for a particular state */
\r
456 #define dfa10_T_empty NULL
\r
458 static const ANTLR3_INT32 dfa10_T0[] =
\r
460 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
\r
461 };static const ANTLR3_INT32 dfa10_T1[] =
\r
463 1, -1, -1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
\r
464 };static const ANTLR3_INT32 dfa10_T2[] =
\r
466 4, -1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, -1, -1, -1, -1, -1, -1, -1, -1, -1,
\r
467 -1, -1, 3, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
\r
468 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 3
\r
471 /* Transition tables are a table of sub tables, with some tables
\r
472 * reused for efficiency.
\r
474 static const ANTLR3_INT32 * const dfa10_transitions[] =
\r
476 dfa10_T1, dfa10_T0, dfa10_T2, dfa10_T_empty, dfa10_T_empty
\r
480 /* Declare tracking structure for Cyclic DFA 10
\r
483 ANTLR3_CYCLIC_DFA cdfa10
\r
485 10, /* Decision number of this dfa */
\r
486 /* Which decision this represents: */
\r
487 (const pANTLR3_UCHAR)"40:1: FLOAT : ( ( '-' )? ( '0' .. '9' )+ '.' ( '0' .. '9' )+ ( EXPONENT )? | ( '-' )? ( '0' .. '9' )+ EXPONENT );",
\r
488 (CDFA_SPECIAL_FUNC) antlr3dfaspecialStateTransition, /* Default special state transition function */
\r
489 antlr3dfaspecialTransition, /* DFA specialTransition is currently just a default function in the runtime */
\r
490 antlr3dfapredict, /* DFA simulator function is in the runtime */
\r
491 dfa10_eot, /* EOT table */
\r
492 dfa10_eof, /* EOF table */
\r
493 dfa10_min, /* Minimum tokens for each state */
\r
494 dfa10_max, /* Maximum tokens for each state */
\r
495 dfa10_accept, /* Accept table */
\r
496 dfa10_special, /* Special transition states */
\r
497 dfa10_transitions /* Table of transition tables */
\r
500 /* End of Cyclic DFA 10
\r
501 * ---------------------
\r
502 *//** Static dfa state tables for Cyclic dfa:
\r
503 * 1:1: Tokens : ( T__34 | T__35 | T__36 | T__37 | T__38 | T__39 | T__40 | T__41 | T__42 | T__43 | T__44 | T__45 | T__46 | T__47 | T__48 | T__49 | ID | INT | FLOAT | COMMENT | WS | STRING );
\r
505 static const ANTLR3_INT32 dfa22_eot[44] =
\r
507 -1, 16, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 16, 16, 16, -1, -1,
\r
508 28, -1, -1, -1, 16, 16, 16, 16, 16, -1, -1, 16, 16, 16, 16, 38, 39, 40,
\r
509 16, 42, -1, -1, -1, 43, -1, -1
\r
511 static const ANTLR3_INT32 dfa22_eof[44] =
\r
513 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
\r
514 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
\r
515 -1, -1, -1, -1, -1, -1, -1, -1
\r
517 static const ANTLR3_INT32 dfa22_min[44] =
\r
519 9, 114, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 97, 117, 97, -1, 48,
\r
520 46, -1, -1, -1, 112, 117, 108, 108, 112, -1, -1, 101, 101, 115, 108, 48,
\r
521 48, 48, 101, 48, -1, -1, -1, 48, -1, -1
\r
523 static const ANTLR3_INT32 dfa22_max[44] =
\r
525 125, 121, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 97, 117, 97, -1,
\r
526 57, 101, -1, -1, -1, 112, 117, 108, 108, 112, -1, -1, 101, 101, 115, 108,
\r
527 122, 122, 122, 101, 122, -1, -1, -1, 122, -1, -1
\r
529 static const ANTLR3_INT32 dfa22_accept[44] =
\r
531 -1, -1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, -1, -1, -1, 17, -1, -1, 20,
\r
532 21, 22, -1, -1, -1, -1, -1, 19, 18, -1, -1, -1, -1, -1, -1, -1, -1, -1,
\r
533 16, 1, 13, -1, 15, 14
\r
535 static const ANTLR3_INT32 dfa22_special[44] =
\r
537 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
\r
538 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
\r
539 -1, -1, -1, -1, -1, -1, -1, -1
\r
542 /** Used when there is no transition table entry for a particular state */
\r
543 #define dfa22_T_empty NULL
\r
545 static const ANTLR3_INT32 dfa22_T0[] =
\r
547 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, -1, -1, -1, -1, -1, -1, -1, 16,
\r
548 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
\r
549 16, 16, 16, 16, 16, 16, 16, -1, -1, -1, -1, 16, -1, 16, 16, 16, 16, 16,
\r
550 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
\r
552 };static const ANTLR3_INT32 dfa22_T1[] =
\r
555 };static const ANTLR3_INT32 dfa22_T2[] =
\r
558 };static const ANTLR3_INT32 dfa22_T3[] =
\r
561 };static const ANTLR3_INT32 dfa22_T4[] =
\r
564 };static const ANTLR3_INT32 dfa22_T5[] =
\r
567 };static const ANTLR3_INT32 dfa22_T6[] =
\r
570 };static const ANTLR3_INT32 dfa22_T7[] =
\r
573 };static const ANTLR3_INT32 dfa22_T8[] =
\r
576 };static const ANTLR3_INT32 dfa22_T9[] =
\r
578 20, 20, -1, -1, 20, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
\r
579 -1, -1, -1, -1, -1, 20, -1, 21, -1, -1, -1, -1, -1, 7, 9, -1, -1, 8, 17,
\r
580 6, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 12, -1, -1, 2, -1, -1, -1,
\r
581 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
\r
582 16, 16, 16, 16, 16, 16, 16, 16, 4, -1, 5, -1, 16, -1, 16, 16, 16, 16, 16,
\r
583 13, 16, 16, 16, 16, 16, 16, 15, 14, 16, 16, 16, 16, 16, 1, 16, 16, 16,
\r
584 16, 16, 16, 10, 3, 11
\r
585 };static const ANTLR3_INT32 dfa22_T10[] =
\r
588 };static const ANTLR3_INT32 dfa22_T11[] =
\r
591 };static const ANTLR3_INT32 dfa22_T12[] =
\r
594 };static const ANTLR3_INT32 dfa22_T13[] =
\r
597 };static const ANTLR3_INT32 dfa22_T14[] =
\r
600 };static const ANTLR3_INT32 dfa22_T15[] =
\r
602 27, -1, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, -1, -1, -1, -1, -1, -1,
\r
603 -1, -1, -1, -1, -1, 27, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
\r
604 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
\r
606 };static const ANTLR3_INT32 dfa22_T16[] =
\r
608 23, -1, -1, -1, -1, -1, -1, 22
\r
609 };static const ANTLR3_INT32 dfa22_T17[] =
\r
611 18, 18, 18, 18, 18, 18, 18, 18, 18, 18
\r
614 /* Transition tables are a table of sub tables, with some tables
\r
615 * reused for efficiency.
\r
617 static const ANTLR3_INT32 * const dfa22_transitions[] =
\r
619 dfa22_T9, dfa22_T16, dfa22_T_empty, dfa22_T_empty, dfa22_T_empty, dfa22_T_empty,
\r
620 dfa22_T_empty, dfa22_T_empty, dfa22_T_empty, dfa22_T_empty, dfa22_T_empty,
\r
621 dfa22_T_empty, dfa22_T_empty, dfa22_T10, dfa22_T8, dfa22_T4, dfa22_T_empty,
\r
622 dfa22_T17, dfa22_T15, dfa22_T_empty, dfa22_T_empty, dfa22_T_empty, dfa22_T13,
\r
623 dfa22_T6, dfa22_T3, dfa22_T11, dfa22_T7, dfa22_T_empty, dfa22_T_empty,
\r
624 dfa22_T14, dfa22_T5, dfa22_T2, dfa22_T12, dfa22_T0, dfa22_T0, dfa22_T0,
\r
625 dfa22_T1, dfa22_T0, dfa22_T_empty, dfa22_T_empty, dfa22_T_empty, dfa22_T0,
\r
626 dfa22_T_empty, dfa22_T_empty
\r
630 /* Declare tracking structure for Cyclic DFA 22
\r
633 ANTLR3_CYCLIC_DFA cdfa22
\r
635 22, /* Decision number of this dfa */
\r
636 /* Which decision this represents: */
\r
637 (const pANTLR3_UCHAR)"1:1: Tokens : ( T__34 | T__35 | T__36 | T__37 | T__38 | T__39 | T__40 | T__41 | T__42 | T__43 | T__44 | T__45 | T__46 | T__47 | T__48 | T__49 | ID | INT | FLOAT | COMMENT | WS | STRING );",
\r
638 (CDFA_SPECIAL_FUNC) antlr3dfaspecialStateTransition, /* Default special state transition function */
\r
639 antlr3dfaspecialTransition, /* DFA specialTransition is currently just a default function in the runtime */
\r
640 antlr3dfapredict, /* DFA simulator function is in the runtime */
\r
641 dfa22_eot, /* EOT table */
\r
642 dfa22_eof, /* EOF table */
\r
643 dfa22_min, /* Minimum tokens for each state */
\r
644 dfa22_max, /* Maximum tokens for each state */
\r
645 dfa22_accept, /* Accept table */
\r
646 dfa22_special, /* Special transition states */
\r
647 dfa22_transitions /* Table of transition tables */
\r
650 /* End of Cyclic DFA 22
\r
651 * ---------------------
\r
653 /* =========================================================================
\r
654 * End of DFA tables for the lexer
\r
657 /* =========================================================================
\r
658 * Functions to match the lexer grammar defined tokens from the input stream
\r
661 // Comes from: 7:7: ( 'type' )
\r
662 /** \brief Lexer rule generated by ANTLR3
\r
664 * $ANTLR start T__34
\r
666 * Looks to match the characters the constitute the token T__34
\r
667 * from the attached input stream.
\r
671 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
673 static ANTLR3_INLINE
\r
674 void mT__34(pSimanticsDataLexer ctx)
\r
676 ANTLR3_UINT32 _type;
\r
681 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:7:7: ( 'type' )
\r
682 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:7:9: 'type'
\r
685 if (HASEXCEPTION())
\r
694 LEXSTATE->type = _type;
\r
696 // This is where rules clean up and exit
\r
698 goto ruleT__34Ex; /* Prevent compiler warnings */
\r
702 // $ANTLR end T__34
\r
704 // Comes from: 8:7: ( '=' )
\r
705 /** \brief Lexer rule generated by ANTLR3
\r
707 * $ANTLR start T__35
\r
709 * Looks to match the characters the constitute the token T__35
\r
710 * from the attached input stream.
\r
714 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
716 static ANTLR3_INLINE
\r
717 void mT__35(pSimanticsDataLexer ctx)
\r
719 ANTLR3_UINT32 _type;
\r
724 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:8:7: ( '=' )
\r
725 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:8:9: '='
\r
728 if (HASEXCEPTION())
\r
736 LEXSTATE->type = _type;
\r
738 // This is where rules clean up and exit
\r
740 goto ruleT__35Ex; /* Prevent compiler warnings */
\r
744 // $ANTLR end T__35
\r
746 // Comes from: 9:7: ( '|' )
\r
747 /** \brief Lexer rule generated by ANTLR3
\r
749 * $ANTLR start T__36
\r
751 * Looks to match the characters the constitute the token T__36
\r
752 * from the attached input stream.
\r
756 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
758 static ANTLR3_INLINE
\r
759 void mT__36(pSimanticsDataLexer ctx)
\r
761 ANTLR3_UINT32 _type;
\r
766 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:9:7: ( '|' )
\r
767 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:9:9: '|'
\r
770 if (HASEXCEPTION())
\r
778 LEXSTATE->type = _type;
\r
780 // This is where rules clean up and exit
\r
782 goto ruleT__36Ex; /* Prevent compiler warnings */
\r
786 // $ANTLR end T__36
\r
788 // Comes from: 10:7: ( '[' )
\r
789 /** \brief Lexer rule generated by ANTLR3
\r
791 * $ANTLR start T__37
\r
793 * Looks to match the characters the constitute the token T__37
\r
794 * from the attached input stream.
\r
798 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
800 static ANTLR3_INLINE
\r
801 void mT__37(pSimanticsDataLexer ctx)
\r
803 ANTLR3_UINT32 _type;
\r
808 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:10:7: ( '[' )
\r
809 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:10:9: '['
\r
812 if (HASEXCEPTION())
\r
820 LEXSTATE->type = _type;
\r
822 // This is where rules clean up and exit
\r
824 goto ruleT__37Ex; /* Prevent compiler warnings */
\r
828 // $ANTLR end T__37
\r
830 // Comes from: 11:7: ( ']' )
\r
831 /** \brief Lexer rule generated by ANTLR3
\r
833 * $ANTLR start T__38
\r
835 * Looks to match the characters the constitute the token T__38
\r
836 * from the attached input stream.
\r
840 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
842 static ANTLR3_INLINE
\r
843 void mT__38(pSimanticsDataLexer ctx)
\r
845 ANTLR3_UINT32 _type;
\r
850 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:11:7: ( ']' )
\r
851 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:11:9: ']'
\r
854 if (HASEXCEPTION())
\r
862 LEXSTATE->type = _type;
\r
864 // This is where rules clean up and exit
\r
866 goto ruleT__38Ex; /* Prevent compiler warnings */
\r
870 // $ANTLR end T__38
\r
872 // Comes from: 12:7: ( '..' )
\r
873 /** \brief Lexer rule generated by ANTLR3
\r
875 * $ANTLR start T__39
\r
877 * Looks to match the characters the constitute the token T__39
\r
878 * from the attached input stream.
\r
882 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
884 static ANTLR3_INLINE
\r
885 void mT__39(pSimanticsDataLexer ctx)
\r
887 ANTLR3_UINT32 _type;
\r
892 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:12:7: ( '..' )
\r
893 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:12:9: '..'
\r
896 if (HASEXCEPTION())
\r
905 LEXSTATE->type = _type;
\r
907 // This is where rules clean up and exit
\r
909 goto ruleT__39Ex; /* Prevent compiler warnings */
\r
913 // $ANTLR end T__39
\r
915 // Comes from: 13:7: ( '(' )
\r
916 /** \brief Lexer rule generated by ANTLR3
\r
918 * $ANTLR start T__40
\r
920 * Looks to match the characters the constitute the token T__40
\r
921 * from the attached input stream.
\r
925 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
927 static ANTLR3_INLINE
\r
928 void mT__40(pSimanticsDataLexer ctx)
\r
930 ANTLR3_UINT32 _type;
\r
935 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:13:7: ( '(' )
\r
936 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:13:9: '('
\r
939 if (HASEXCEPTION())
\r
947 LEXSTATE->type = _type;
\r
949 // This is where rules clean up and exit
\r
951 goto ruleT__40Ex; /* Prevent compiler warnings */
\r
955 // $ANTLR end T__40
\r
957 // Comes from: 14:7: ( ',' )
\r
958 /** \brief Lexer rule generated by ANTLR3
\r
960 * $ANTLR start T__41
\r
962 * Looks to match the characters the constitute the token T__41
\r
963 * from the attached input stream.
\r
967 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
969 static ANTLR3_INLINE
\r
970 void mT__41(pSimanticsDataLexer ctx)
\r
972 ANTLR3_UINT32 _type;
\r
977 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:14:7: ( ',' )
\r
978 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:14:9: ','
\r
981 if (HASEXCEPTION())
\r
989 LEXSTATE->type = _type;
\r
991 // This is where rules clean up and exit
\r
993 goto ruleT__41Ex; /* Prevent compiler warnings */
\r
997 // $ANTLR end T__41
\r
999 // Comes from: 15:7: ( ')' )
\r
1000 /** \brief Lexer rule generated by ANTLR3
\r
1002 * $ANTLR start T__42
\r
1004 * Looks to match the characters the constitute the token T__42
\r
1005 * from the attached input stream.
\r
1009 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1011 static ANTLR3_INLINE
\r
1012 void mT__42(pSimanticsDataLexer ctx)
\r
1014 ANTLR3_UINT32 _type;
\r
1019 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:15:7: ( ')' )
\r
1020 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:15:9: ')'
\r
1023 if (HASEXCEPTION())
\r
1031 LEXSTATE->type = _type;
\r
1033 // This is where rules clean up and exit
\r
1035 goto ruleT__42Ex; /* Prevent compiler warnings */
\r
1039 // $ANTLR end T__42
\r
1041 // Comes from: 16:7: ( '{' )
\r
1042 /** \brief Lexer rule generated by ANTLR3
\r
1044 * $ANTLR start T__43
\r
1046 * Looks to match the characters the constitute the token T__43
\r
1047 * from the attached input stream.
\r
1051 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1053 static ANTLR3_INLINE
\r
1054 void mT__43(pSimanticsDataLexer ctx)
\r
1056 ANTLR3_UINT32 _type;
\r
1061 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:16:7: ( '{' )
\r
1062 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:16:9: '{'
\r
1065 if (HASEXCEPTION())
\r
1073 LEXSTATE->type = _type;
\r
1075 // This is where rules clean up and exit
\r
1077 goto ruleT__43Ex; /* Prevent compiler warnings */
\r
1081 // $ANTLR end T__43
\r
1083 // Comes from: 17:7: ( '}' )
\r
1084 /** \brief Lexer rule generated by ANTLR3
\r
1086 * $ANTLR start T__44
\r
1088 * Looks to match the characters the constitute the token T__44
\r
1089 * from the attached input stream.
\r
1093 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1095 static ANTLR3_INLINE
\r
1096 void mT__44(pSimanticsDataLexer ctx)
\r
1098 ANTLR3_UINT32 _type;
\r
1103 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:17:7: ( '}' )
\r
1104 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:17:9: '}'
\r
1107 if (HASEXCEPTION())
\r
1115 LEXSTATE->type = _type;
\r
1117 // This is where rules clean up and exit
\r
1119 goto ruleT__44Ex; /* Prevent compiler warnings */
\r
1123 // $ANTLR end T__44
\r
1125 // Comes from: 18:7: ( ':' )
\r
1126 /** \brief Lexer rule generated by ANTLR3
\r
1128 * $ANTLR start T__45
\r
1130 * Looks to match the characters the constitute the token T__45
\r
1131 * from the attached input stream.
\r
1135 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1137 static ANTLR3_INLINE
\r
1138 void mT__45(pSimanticsDataLexer ctx)
\r
1140 ANTLR3_UINT32 _type;
\r
1145 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:18:7: ( ':' )
\r
1146 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:18:9: ':'
\r
1149 if (HASEXCEPTION())
\r
1157 LEXSTATE->type = _type;
\r
1159 // This is where rules clean up and exit
\r
1161 goto ruleT__45Ex; /* Prevent compiler warnings */
\r
1165 // $ANTLR end T__45
\r
1167 // Comes from: 19:7: ( 'true' )
\r
1168 /** \brief Lexer rule generated by ANTLR3
\r
1170 * $ANTLR start T__46
\r
1172 * Looks to match the characters the constitute the token T__46
\r
1173 * from the attached input stream.
\r
1177 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1179 static ANTLR3_INLINE
\r
1180 void mT__46(pSimanticsDataLexer ctx)
\r
1182 ANTLR3_UINT32 _type;
\r
1187 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:19:7: ( 'true' )
\r
1188 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:19:9: 'true'
\r
1191 if (HASEXCEPTION())
\r
1200 LEXSTATE->type = _type;
\r
1202 // This is where rules clean up and exit
\r
1204 goto ruleT__46Ex; /* Prevent compiler warnings */
\r
1208 // $ANTLR end T__46
\r
1210 // Comes from: 20:7: ( 'false' )
\r
1211 /** \brief Lexer rule generated by ANTLR3
\r
1213 * $ANTLR start T__47
\r
1215 * Looks to match the characters the constitute the token T__47
\r
1216 * from the attached input stream.
\r
1220 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1222 static ANTLR3_INLINE
\r
1223 void mT__47(pSimanticsDataLexer ctx)
\r
1225 ANTLR3_UINT32 _type;
\r
1230 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:20:7: ( 'false' )
\r
1231 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:20:9: 'false'
\r
1234 if (HASEXCEPTION())
\r
1243 LEXSTATE->type = _type;
\r
1245 // This is where rules clean up and exit
\r
1247 goto ruleT__47Ex; /* Prevent compiler warnings */
\r
1251 // $ANTLR end T__47
\r
1253 // Comes from: 21:7: ( 'null' )
\r
1254 /** \brief Lexer rule generated by ANTLR3
\r
1256 * $ANTLR start T__48
\r
1258 * Looks to match the characters the constitute the token T__48
\r
1259 * from the attached input stream.
\r
1263 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1265 static ANTLR3_INLINE
\r
1266 void mT__48(pSimanticsDataLexer ctx)
\r
1268 ANTLR3_UINT32 _type;
\r
1273 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:21:7: ( 'null' )
\r
1274 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:21:9: 'null'
\r
1277 if (HASEXCEPTION())
\r
1286 LEXSTATE->type = _type;
\r
1288 // This is where rules clean up and exit
\r
1290 goto ruleT__48Ex; /* Prevent compiler warnings */
\r
1294 // $ANTLR end T__48
\r
1296 // Comes from: 22:7: ( 'map' )
\r
1297 /** \brief Lexer rule generated by ANTLR3
\r
1299 * $ANTLR start T__49
\r
1301 * Looks to match the characters the constitute the token T__49
\r
1302 * from the attached input stream.
\r
1306 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1308 static ANTLR3_INLINE
\r
1309 void mT__49(pSimanticsDataLexer ctx)
\r
1311 ANTLR3_UINT32 _type;
\r
1316 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:22:7: ( 'map' )
\r
1317 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:22:9: 'map'
\r
1320 if (HASEXCEPTION())
\r
1329 LEXSTATE->type = _type;
\r
1331 // This is where rules clean up and exit
\r
1333 goto ruleT__49Ex; /* Prevent compiler warnings */
\r
1337 // $ANTLR end T__49
\r
1339 // Comes from: 34:5: ( ( 'a' .. 'z' | 'A' .. 'Z' | '_' ) ( 'a' .. 'z' | 'A' .. 'Z' | '0' .. '9' | '_' )* )
\r
1340 /** \brief Lexer rule generated by ANTLR3
\r
1344 * Looks to match the characters the constitute the token ID
\r
1345 * from the attached input stream.
\r
1349 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1351 static ANTLR3_INLINE
\r
1352 void mID(pSimanticsDataLexer ctx)
\r
1354 ANTLR3_UINT32 _type;
\r
1359 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:34:5: ( ( 'a' .. 'z' | 'A' .. 'Z' | '_' ) ( 'a' .. 'z' | 'A' .. 'Z' | '0' .. '9' | '_' )* )
\r
1360 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:34:7: ( 'a' .. 'z' | 'A' .. 'Z' | '_' ) ( 'a' .. 'z' | 'A' .. 'Z' | '0' .. '9' | '_' )*
\r
1362 if ( ((LA(1) >= 'A') && (LA(1) <= 'Z')) || LA(1) == '_' || ((LA(1) >= 'a') && (LA(1) <= 'z')) )
\r
1370 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
1371 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
1373 LRECOVER(); goto ruleIDEx;
\r
1377 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:34:31: ( 'a' .. 'z' | 'A' .. 'Z' | '0' .. '9' | '_' )*
\r
1457 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:
\r
1459 if ( ((LA(1) >= '0') && (LA(1) <= '9')) || ((LA(1) >= 'A') && (LA(1) <= 'Z')) || LA(1) == '_' || ((LA(1) >= 'a') && (LA(1) <= 'z')) )
\r
1467 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
1468 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
1470 LRECOVER(); goto ruleIDEx;
\r
1478 goto loop1; /* break out of the loop */
\r
1482 loop1: ; /* Jump out to here if this rule does not match */
\r
1487 LEXSTATE->type = _type;
\r
1489 // This is where rules clean up and exit
\r
1491 goto ruleIDEx; /* Prevent compiler warnings */
\r
1497 // Comes from: 37:5: ( ( '-' )? ( '0' .. '9' )+ )
\r
1498 /** \brief Lexer rule generated by ANTLR3
\r
1500 * $ANTLR start INT
\r
1502 * Looks to match the characters the constitute the token INT
\r
1503 * from the attached input stream.
\r
1507 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1509 static ANTLR3_INLINE
\r
1510 void mINT(pSimanticsDataLexer ctx)
\r
1512 ANTLR3_UINT32 _type;
\r
1517 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:37:5: ( ( '-' )? ( '0' .. '9' )+ )
\r
1518 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:37:7: ( '-' )? ( '0' .. '9' )+
\r
1521 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:37:7: ( '-' )?
\r
1536 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:37:7: '-'
\r
1539 if (HASEXCEPTION())
\r
1550 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:37:12: ( '0' .. '9' )+
\r
1579 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:37:12: '0' .. '9'
\r
1581 MATCHRANGE('0', '9');
\r
1582 if (HASEXCEPTION())
\r
1597 /* mismatchedSetEx()
\r
1600 EXCEPTION->type = ANTLR3_EARLY_EXIT_EXCEPTION;
\r
1601 EXCEPTION->name = (void *)ANTLR3_EARLY_EXIT_NAME;
\r
1608 loop3: ; /* Jump to here if this rule does not match */
\r
1613 LEXSTATE->type = _type;
\r
1615 // This is where rules clean up and exit
\r
1617 goto ruleINTEx; /* Prevent compiler warnings */
\r
1623 // Comes from: 41:5: ( ( '-' )? ( '0' .. '9' )+ '.' ( '0' .. '9' )+ ( EXPONENT )? | ( '-' )? ( '0' .. '9' )+ EXPONENT )
\r
1624 /** \brief Lexer rule generated by ANTLR3
\r
1626 * $ANTLR start FLOAT
\r
1628 * Looks to match the characters the constitute the token FLOAT
\r
1629 * from the attached input stream.
\r
1633 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1635 static ANTLR3_INLINE
\r
1636 void mFLOAT(pSimanticsDataLexer ctx)
\r
1638 ANTLR3_UINT32 _type;
\r
1644 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:41:5: ( ( '-' )? ( '0' .. '9' )+ '.' ( '0' .. '9' )+ ( EXPONENT )? | ( '-' )? ( '0' .. '9' )+ EXPONENT )
\r
1646 ANTLR3_UINT32 alt10;
\r
1650 alt10 = cdfa10.predict(ctx, RECOGNIZER, ISTREAM, &cdfa10);
\r
1651 if (HASEXCEPTION())
\r
1659 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:41:9: ( '-' )? ( '0' .. '9' )+ '.' ( '0' .. '9' )+ ( EXPONENT )?
\r
1662 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:41:9: ( '-' )?
\r
1677 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:41:9: '-'
\r
1680 if (HASEXCEPTION())
\r
1691 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:41:14: ( '0' .. '9' )+
\r
1720 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:41:15: '0' .. '9'
\r
1722 MATCHRANGE('0', '9');
\r
1723 if (HASEXCEPTION())
\r
1738 /* mismatchedSetEx()
\r
1741 EXCEPTION->type = ANTLR3_EARLY_EXIT_EXCEPTION;
\r
1742 EXCEPTION->name = (void *)ANTLR3_EARLY_EXIT_NAME;
\r
1749 loop5: ; /* Jump to here if this rule does not match */
\r
1752 if (HASEXCEPTION())
\r
1757 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:41:30: ( '0' .. '9' )+
\r
1786 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:41:31: '0' .. '9'
\r
1788 MATCHRANGE('0', '9');
\r
1789 if (HASEXCEPTION())
\r
1804 /* mismatchedSetEx()
\r
1807 EXCEPTION->type = ANTLR3_EARLY_EXIT_EXCEPTION;
\r
1808 EXCEPTION->name = (void *)ANTLR3_EARLY_EXIT_NAME;
\r
1815 loop6: ; /* Jump to here if this rule does not match */
\r
1818 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:41:42: ( EXPONENT )?
\r
1834 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:41:42: EXPONENT
\r
1836 /* 41:42: EXPONENT */
\r
1838 if (HASEXCEPTION())
\r
1853 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:43:9: ( '-' )? ( '0' .. '9' )+ EXPONENT
\r
1856 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:43:9: ( '-' )?
\r
1871 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:43:9: '-'
\r
1874 if (HASEXCEPTION())
\r
1885 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:43:14: ( '0' .. '9' )+
\r
1914 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:43:15: '0' .. '9'
\r
1916 MATCHRANGE('0', '9');
\r
1917 if (HASEXCEPTION())
\r
1932 /* mismatchedSetEx()
\r
1935 EXCEPTION->type = ANTLR3_EARLY_EXIT_EXCEPTION;
\r
1936 EXCEPTION->name = (void *)ANTLR3_EARLY_EXIT_NAME;
\r
1943 loop9: ; /* Jump to here if this rule does not match */
\r
1945 /* 43:9: ( '-' )? ( '0' .. '9' )+ EXPONENT */
\r
1947 if (HASEXCEPTION())
\r
1958 LEXSTATE->type = _type;
\r
1960 // This is where rules clean up and exit
\r
1962 goto ruleFLOATEx; /* Prevent compiler warnings */
\r
1966 // $ANTLR end FLOAT
\r
1968 // Comes from: 47:5: ( '//' (~ ( '\\n' | '\\r' ) )* ( '\\r' )? '\\n' | '/*' ( options {greedy=false; } : . )* '*/' )
\r
1969 /** \brief Lexer rule generated by ANTLR3
\r
1971 * $ANTLR start COMMENT
\r
1973 * Looks to match the characters the constitute the token COMMENT
\r
1974 * from the attached input stream.
\r
1978 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
1980 static ANTLR3_INLINE
\r
1981 void mCOMMENT(pSimanticsDataLexer ctx)
\r
1983 ANTLR3_UINT32 _type;
\r
1989 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:47:5: ( '//' (~ ( '\\n' | '\\r' ) )* ( '\\r' )? '\\n' | '/*' ( options {greedy=false; } : . )* '*/' )
\r
1991 ANTLR3_UINT32 alt14;
\r
2014 EXCEPTION->type = ANTLR3_NO_VIABLE_ALT_EXCEPTION;
\r
2015 EXCEPTION->message = (void *)"";
\r
2016 EXCEPTION->decisionNum = 14;
\r
2017 EXCEPTION->state = 1;
\r
2020 goto ruleCOMMENTEx;
\r
2028 EXCEPTION->type = ANTLR3_NO_VIABLE_ALT_EXCEPTION;
\r
2029 EXCEPTION->message = (void *)"";
\r
2030 EXCEPTION->decisionNum = 14;
\r
2031 EXCEPTION->state = 0;
\r
2034 goto ruleCOMMENTEx;
\r
2040 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:47:9: '//' (~ ( '\\n' | '\\r' ) )* ( '\\r' )? '\\n'
\r
2043 if (HASEXCEPTION())
\r
2045 goto ruleCOMMENTEx;
\r
2050 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:47:14: (~ ( '\\n' | '\\r' ) )*
\r
2056 /* dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState)
\r
2058 int LA11_0 = LA(1);
\r
2059 if ( (((LA11_0 >= 0x0000) && (LA11_0 <= '\t')) || ((LA11_0 >= 0x000B) && (LA11_0 <= '\f')) || ((LA11_0 >= 0x000E) && (LA11_0 <= 0xFFFF))) )
\r
2068 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:47:14: ~ ( '\\n' | '\\r' )
\r
2070 if ( ((LA(1) >= 0x0000) && (LA(1) <= '\t')) || ((LA(1) >= 0x000B) && (LA(1) <= '\f')) || ((LA(1) >= 0x000E) && (LA(1) <= 0xFFFF)) )
\r
2078 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
2079 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
2081 LRECOVER(); goto ruleCOMMENTEx;
\r
2089 goto loop11; /* break out of the loop */
\r
2093 loop11: ; /* Jump out to here if this rule does not match */
\r
2096 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:47:28: ( '\\r' )?
\r
2111 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:47:28: '\\r'
\r
2114 if (HASEXCEPTION())
\r
2116 goto ruleCOMMENTEx;
\r
2126 if (HASEXCEPTION())
\r
2128 goto ruleCOMMENTEx;
\r
2132 LEXSTATE->channel=HIDDEN;
\r
2138 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:48:9: '/*' ( options {greedy=false; } : . )* '*/'
\r
2141 if (HASEXCEPTION())
\r
2143 goto ruleCOMMENTEx;
\r
2148 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:48:14: ( options {greedy=false; } : . )*
\r
2154 /* dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState)
\r
2156 int LA13_0 = LA(1);
\r
2157 if ( (LA13_0 == '*') )
\r
2160 /* dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState)
\r
2162 int LA13_1 = LA(2);
\r
2163 if ( (LA13_1 == '/') )
\r
2167 else if ( (((LA13_1 >= 0x0000) && (LA13_1 <= '.')) || ((LA13_1 >= '0') && (LA13_1 <= 0xFFFF))) )
\r
2174 else if ( (((LA13_0 >= 0x0000) && (LA13_0 <= ')')) || ((LA13_0 >= '+') && (LA13_0 <= 0xFFFF))) )
\r
2183 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:48:42: .
\r
2186 if (HASEXCEPTION())
\r
2188 goto ruleCOMMENTEx;
\r
2196 goto loop13; /* break out of the loop */
\r
2200 loop13: ; /* Jump out to here if this rule does not match */
\r
2203 if (HASEXCEPTION())
\r
2205 goto ruleCOMMENTEx;
\r
2210 LEXSTATE->channel=HIDDEN;
\r
2218 LEXSTATE->type = _type;
\r
2220 // This is where rules clean up and exit
\r
2222 goto ruleCOMMENTEx; /* Prevent compiler warnings */
\r
2226 // $ANTLR end COMMENT
\r
2228 // Comes from: 51:5: ( ( ' ' | '\\t' | '\\r' | '\\n' ) )
\r
2229 /** \brief Lexer rule generated by ANTLR3
\r
2233 * Looks to match the characters the constitute the token WS
\r
2234 * from the attached input stream.
\r
2238 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
2240 static ANTLR3_INLINE
\r
2241 void mWS(pSimanticsDataLexer ctx)
\r
2243 ANTLR3_UINT32 _type;
\r
2248 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:51:5: ( ( ' ' | '\\t' | '\\r' | '\\n' ) )
\r
2249 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:51:9: ( ' ' | '\\t' | '\\r' | '\\n' )
\r
2251 if ( ((LA(1) >= '\t') && (LA(1) <= '\n')) || LA(1) == '\r' || LA(1) == ' ' )
\r
2259 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
2260 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
2262 LRECOVER(); goto ruleWSEx;
\r
2266 LEXSTATE->channel=HIDDEN;
\r
2271 LEXSTATE->type = _type;
\r
2273 // This is where rules clean up and exit
\r
2275 goto ruleWSEx; /* Prevent compiler warnings */
\r
2281 // Comes from: 59:5: ( '\"' ( ESC_SEQ | ~ ( '\\\\' | '\"' ) )* '\"' | '\"\"\"' (~ ( '\"' ) | '\"' ~ ( '\"' ) | '\"\"' ~ ( '\"' ) )* '\"\"\"' )
\r
2282 /** \brief Lexer rule generated by ANTLR3
\r
2284 * $ANTLR start STRING
\r
2286 * Looks to match the characters the constitute the token STRING
\r
2287 * from the attached input stream.
\r
2291 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
2293 static ANTLR3_INLINE
\r
2294 void mSTRING(pSimanticsDataLexer ctx)
\r
2296 ANTLR3_UINT32 _type;
\r
2302 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:59:5: ( '\"' ( ESC_SEQ | ~ ( '\\\\' | '\"' ) )* '\"' | '\"\"\"' (~ ( '\"' ) | '\"' ~ ( '\"' ) | '\"\"' ~ ( '\"' ) )* '\"\"\"' )
\r
2304 ANTLR3_UINT32 alt17;
\r
2314 int LA17_1 = LA(2);
\r
2315 if ( (LA17_1 == '"') )
\r
2329 else if ( (((LA17_1 >= 0x0000) && (LA17_1 <= '!')) || ((LA17_1 >= '#') && (LA17_1 <= 0xFFFF))) )
\r
2337 EXCEPTION->type = ANTLR3_NO_VIABLE_ALT_EXCEPTION;
\r
2338 EXCEPTION->message = (void *)"";
\r
2339 EXCEPTION->decisionNum = 17;
\r
2340 EXCEPTION->state = 1;
\r
2343 goto ruleSTRINGEx;
\r
2351 EXCEPTION->type = ANTLR3_NO_VIABLE_ALT_EXCEPTION;
\r
2352 EXCEPTION->message = (void *)"";
\r
2353 EXCEPTION->decisionNum = 17;
\r
2354 EXCEPTION->state = 0;
\r
2357 goto ruleSTRINGEx;
\r
2363 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:59:8: '\"' ( ESC_SEQ | ~ ( '\\\\' | '\"' ) )* '\"'
\r
2366 if (HASEXCEPTION())
\r
2368 goto ruleSTRINGEx;
\r
2372 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:59:12: ( ESC_SEQ | ~ ( '\\\\' | '\"' ) )*
\r
2378 /* dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState)
\r
2380 int LA15_0 = LA(1);
\r
2381 if ( (LA15_0 == '\\') )
\r
2385 else if ( (((LA15_0 >= 0x0000) && (LA15_0 <= '!')) || ((LA15_0 >= '#') && (LA15_0 <= '[')) || ((LA15_0 >= ']') && (LA15_0 <= 0xFFFF))) )
\r
2394 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:59:14: ESC_SEQ
\r
2396 /* 59:14: ESC_SEQ */
\r
2398 if (HASEXCEPTION())
\r
2400 goto ruleSTRINGEx;
\r
2407 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:59:24: ~ ( '\\\\' | '\"' )
\r
2409 if ( ((LA(1) >= 0x0000) && (LA(1) <= '!')) || ((LA(1) >= '#') && (LA(1) <= '[')) || ((LA(1) >= ']') && (LA(1) <= 0xFFFF)) )
\r
2417 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
2418 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
2420 LRECOVER(); goto ruleSTRINGEx;
\r
2428 goto loop15; /* break out of the loop */
\r
2432 loop15: ; /* Jump out to here if this rule does not match */
\r
2435 if (HASEXCEPTION())
\r
2437 goto ruleSTRINGEx;
\r
2444 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:60:8: '\"\"\"' (~ ( '\"' ) | '\"' ~ ( '\"' ) | '\"\"' ~ ( '\"' ) )* '\"\"\"'
\r
2447 if (HASEXCEPTION())
\r
2449 goto ruleSTRINGEx;
\r
2454 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:60:14: (~ ( '\"' ) | '\"' ~ ( '\"' ) | '\"\"' ~ ( '\"' ) )*
\r
2460 /* dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState)
\r
2462 int LA16_0 = LA(1);
\r
2463 if ( (LA16_0 == '"') )
\r
2466 /* dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState)
\r
2468 int LA16_1 = LA(2);
\r
2469 if ( (LA16_1 == '"') )
\r
2472 /* dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState)
\r
2474 int LA16_3 = LA(3);
\r
2475 if ( (((LA16_3 >= 0x0000) && (LA16_3 <= '!')) || ((LA16_3 >= '#') && (LA16_3 <= 0xFFFF))) )
\r
2482 else if ( (((LA16_1 >= 0x0000) && (LA16_1 <= '!')) || ((LA16_1 >= '#') && (LA16_1 <= 0xFFFF))) )
\r
2489 else if ( (((LA16_0 >= 0x0000) && (LA16_0 <= '!')) || ((LA16_0 >= '#') && (LA16_0 <= 0xFFFF))) )
\r
2498 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:60:16: ~ ( '\"' )
\r
2500 if ( ((LA(1) >= 0x0000) && (LA(1) <= '!')) || ((LA(1) >= '#') && (LA(1) <= 0xFFFF)) )
\r
2508 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
2509 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
2511 LRECOVER(); goto ruleSTRINGEx;
\r
2518 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:60:25: '\"' ~ ( '\"' )
\r
2521 if (HASEXCEPTION())
\r
2523 goto ruleSTRINGEx;
\r
2526 if ( ((LA(1) >= 0x0000) && (LA(1) <= '!')) || ((LA(1) >= '#') && (LA(1) <= 0xFFFF)) )
\r
2534 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
2535 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
2537 LRECOVER(); goto ruleSTRINGEx;
\r
2544 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:60:38: '\"\"' ~ ( '\"' )
\r
2547 if (HASEXCEPTION())
\r
2549 goto ruleSTRINGEx;
\r
2553 if ( ((LA(1) >= 0x0000) && (LA(1) <= '!')) || ((LA(1) >= '#') && (LA(1) <= 0xFFFF)) )
\r
2561 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
2562 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
2564 LRECOVER(); goto ruleSTRINGEx;
\r
2572 goto loop16; /* break out of the loop */
\r
2576 loop16: ; /* Jump out to here if this rule does not match */
\r
2579 if (HASEXCEPTION())
\r
2581 goto ruleSTRINGEx;
\r
2591 LEXSTATE->type = _type;
\r
2593 // This is where rules clean up and exit
\r
2595 goto ruleSTRINGEx; /* Prevent compiler warnings */
\r
2599 // $ANTLR end STRING
\r
2601 // Comes from: 64:10: ( ( 'e' | 'E' ) ( '+' | '-' )? ( '0' .. '9' )+ )
\r
2602 /** \brief Lexer rule generated by ANTLR3
\r
2604 * $ANTLR start EXPONENT
\r
2606 * Looks to match the characters the constitute the token EXPONENT
\r
2607 * from the attached input stream.
\r
2611 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
2613 static ANTLR3_INLINE
\r
2614 void mEXPONENT(pSimanticsDataLexer ctx)
\r
2616 ANTLR3_UINT32 _type;
\r
2619 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:64:10: ( ( 'e' | 'E' ) ( '+' | '-' )? ( '0' .. '9' )+ )
\r
2620 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:64:12: ( 'e' | 'E' ) ( '+' | '-' )? ( '0' .. '9' )+
\r
2622 if ( LA(1) == 'E' || LA(1) == 'e' )
\r
2630 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
2631 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
2633 LRECOVER(); goto ruleEXPONENTEx;
\r
2637 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:64:22: ( '+' | '-' )?
\r
2653 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:
\r
2655 if ( LA(1) == '+' || LA(1) == '-' )
\r
2663 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
2664 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
2666 LRECOVER(); goto ruleEXPONENTEx;
\r
2675 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:64:33: ( '0' .. '9' )+
\r
2704 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:64:34: '0' .. '9'
\r
2706 MATCHRANGE('0', '9');
\r
2707 if (HASEXCEPTION())
\r
2709 goto ruleEXPONENTEx;
\r
2722 /* mismatchedSetEx()
\r
2725 EXCEPTION->type = ANTLR3_EARLY_EXIT_EXCEPTION;
\r
2726 EXCEPTION->name = (void *)ANTLR3_EARLY_EXIT_NAME;
\r
2729 goto ruleEXPONENTEx;
\r
2733 loop19: ; /* Jump to here if this rule does not match */
\r
2740 // This is where rules clean up and exit
\r
2742 goto ruleEXPONENTEx; /* Prevent compiler warnings */
\r
2746 // $ANTLR end EXPONENT
\r
2748 // Comes from: 67:11: ( ( '0' .. '9' | 'a' .. 'f' | 'A' .. 'F' ) )
\r
2749 /** \brief Lexer rule generated by ANTLR3
\r
2751 * $ANTLR start HEX_DIGIT
\r
2753 * Looks to match the characters the constitute the token HEX_DIGIT
\r
2754 * from the attached input stream.
\r
2758 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
2760 static ANTLR3_INLINE
\r
2761 void mHEX_DIGIT(pSimanticsDataLexer ctx)
\r
2763 ANTLR3_UINT32 _type;
\r
2766 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:67:11: ( ( '0' .. '9' | 'a' .. 'f' | 'A' .. 'F' ) )
\r
2767 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:67:13: ( '0' .. '9' | 'a' .. 'f' | 'A' .. 'F' )
\r
2769 if ( ((LA(1) >= '0') && (LA(1) <= '9')) || ((LA(1) >= 'A') && (LA(1) <= 'F')) || ((LA(1) >= 'a') && (LA(1) <= 'f')) )
\r
2777 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
2778 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
2780 LRECOVER(); goto ruleHEX_DIGITEx;
\r
2788 // This is where rules clean up and exit
\r
2790 goto ruleHEX_DIGITEx; /* Prevent compiler warnings */
\r
2791 ruleHEX_DIGITEx: ;
\r
2794 // $ANTLR end HEX_DIGIT
\r
2796 // Comes from: 71:5: ( '\\\\' ( 'b' | 't' | 'n' | 'f' | 'r' | '\\\"' | '\\'' | '\\\\' ) | UNICODE_ESC | OCTAL_ESC )
\r
2797 /** \brief Lexer rule generated by ANTLR3
\r
2799 * $ANTLR start ESC_SEQ
\r
2801 * Looks to match the characters the constitute the token ESC_SEQ
\r
2802 * from the attached input stream.
\r
2806 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
2808 static ANTLR3_INLINE
\r
2809 void mESC_SEQ(pSimanticsDataLexer ctx)
\r
2811 ANTLR3_UINT32 _type;
\r
2815 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:71:5: ( '\\\\' ( 'b' | 't' | 'n' | 'f' | 'r' | '\\\"' | '\\'' | '\\\\' ) | UNICODE_ESC | OCTAL_ESC )
\r
2817 ANTLR3_UINT32 alt20;
\r
2859 EXCEPTION->type = ANTLR3_NO_VIABLE_ALT_EXCEPTION;
\r
2860 EXCEPTION->message = (void *)"";
\r
2861 EXCEPTION->decisionNum = 20;
\r
2862 EXCEPTION->state = 1;
\r
2865 goto ruleESC_SEQEx;
\r
2873 EXCEPTION->type = ANTLR3_NO_VIABLE_ALT_EXCEPTION;
\r
2874 EXCEPTION->message = (void *)"";
\r
2875 EXCEPTION->decisionNum = 20;
\r
2876 EXCEPTION->state = 0;
\r
2879 goto ruleESC_SEQEx;
\r
2885 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:71:9: '\\\\' ( 'b' | 't' | 'n' | 'f' | 'r' | '\\\"' | '\\'' | '\\\\' )
\r
2888 if (HASEXCEPTION())
\r
2890 goto ruleESC_SEQEx;
\r
2893 if ( LA(1) == '"' || LA(1) == '\'' || LA(1) == '\\' || LA(1) == 'b' || LA(1) == 'f' || LA(1) == 'n' || LA(1) == 'r' || LA(1) == 't' )
\r
2901 EXCEPTION->type = ANTLR3_MISMATCHED_SET_EXCEPTION;
\r
2902 EXCEPTION->name = (void *)ANTLR3_MISMATCHED_SET_NAME;
\r
2904 LRECOVER(); goto ruleESC_SEQEx;
\r
2911 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:72:9: UNICODE_ESC
\r
2913 /* 72:9: UNICODE_ESC */
\r
2914 mUNICODE_ESC(ctx );
\r
2915 if (HASEXCEPTION())
\r
2917 goto ruleESC_SEQEx;
\r
2924 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:73:9: OCTAL_ESC
\r
2926 /* 73:9: OCTAL_ESC */
\r
2927 mOCTAL_ESC(ctx );
\r
2928 if (HASEXCEPTION())
\r
2930 goto ruleESC_SEQEx;
\r
2941 // This is where rules clean up and exit
\r
2943 goto ruleESC_SEQEx; /* Prevent compiler warnings */
\r
2947 // $ANTLR end ESC_SEQ
\r
2949 // Comes from: 78:5: ( '\\\\' ( '0' .. '3' ) ( '0' .. '7' ) ( '0' .. '7' ) | '\\\\' ( '0' .. '7' ) ( '0' .. '7' ) | '\\\\' ( '0' .. '7' ) )
\r
2950 /** \brief Lexer rule generated by ANTLR3
\r
2952 * $ANTLR start OCTAL_ESC
\r
2954 * Looks to match the characters the constitute the token OCTAL_ESC
\r
2955 * from the attached input stream.
\r
2959 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
2961 static ANTLR3_INLINE
\r
2962 void mOCTAL_ESC(pSimanticsDataLexer ctx)
\r
2964 ANTLR3_UINT32 _type;
\r
2968 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:78:5: ( '\\\\' ( '0' .. '3' ) ( '0' .. '7' ) ( '0' .. '7' ) | '\\\\' ( '0' .. '7' ) ( '0' .. '7' ) | '\\\\' ( '0' .. '7' ) )
\r
2970 ANTLR3_UINT32 alt21;
\r
3050 EXCEPTION->type = ANTLR3_NO_VIABLE_ALT_EXCEPTION;
\r
3051 EXCEPTION->message = (void *)"";
\r
3052 EXCEPTION->decisionNum = 21;
\r
3053 EXCEPTION->state = 1;
\r
3056 goto ruleOCTAL_ESCEx;
\r
3064 EXCEPTION->type = ANTLR3_NO_VIABLE_ALT_EXCEPTION;
\r
3065 EXCEPTION->message = (void *)"";
\r
3066 EXCEPTION->decisionNum = 21;
\r
3067 EXCEPTION->state = 0;
\r
3070 goto ruleOCTAL_ESCEx;
\r
3076 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:78:9: '\\\\' ( '0' .. '3' ) ( '0' .. '7' ) ( '0' .. '7' )
\r
3079 if (HASEXCEPTION())
\r
3081 goto ruleOCTAL_ESCEx;
\r
3084 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:78:14: ( '0' .. '3' )
\r
3085 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:78:15: '0' .. '3'
\r
3087 MATCHRANGE('0', '3');
\r
3088 if (HASEXCEPTION())
\r
3090 goto ruleOCTAL_ESCEx;
\r
3096 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:78:25: ( '0' .. '7' )
\r
3097 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:78:26: '0' .. '7'
\r
3099 MATCHRANGE('0', '7');
\r
3100 if (HASEXCEPTION())
\r
3102 goto ruleOCTAL_ESCEx;
\r
3108 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:78:36: ( '0' .. '7' )
\r
3109 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:78:37: '0' .. '7'
\r
3111 MATCHRANGE('0', '7');
\r
3112 if (HASEXCEPTION())
\r
3114 goto ruleOCTAL_ESCEx;
\r
3124 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:79:9: '\\\\' ( '0' .. '7' ) ( '0' .. '7' )
\r
3127 if (HASEXCEPTION())
\r
3129 goto ruleOCTAL_ESCEx;
\r
3132 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:79:14: ( '0' .. '7' )
\r
3133 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:79:15: '0' .. '7'
\r
3135 MATCHRANGE('0', '7');
\r
3136 if (HASEXCEPTION())
\r
3138 goto ruleOCTAL_ESCEx;
\r
3144 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:79:25: ( '0' .. '7' )
\r
3145 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:79:26: '0' .. '7'
\r
3147 MATCHRANGE('0', '7');
\r
3148 if (HASEXCEPTION())
\r
3150 goto ruleOCTAL_ESCEx;
\r
3160 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:80:9: '\\\\' ( '0' .. '7' )
\r
3163 if (HASEXCEPTION())
\r
3165 goto ruleOCTAL_ESCEx;
\r
3168 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:80:14: ( '0' .. '7' )
\r
3169 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:80:15: '0' .. '7'
\r
3171 MATCHRANGE('0', '7');
\r
3172 if (HASEXCEPTION())
\r
3174 goto ruleOCTAL_ESCEx;
\r
3188 // This is where rules clean up and exit
\r
3190 goto ruleOCTAL_ESCEx; /* Prevent compiler warnings */
\r
3191 ruleOCTAL_ESCEx: ;
\r
3194 // $ANTLR end OCTAL_ESC
\r
3196 // Comes from: 85:5: ( '\\\\' 'u' HEX_DIGIT HEX_DIGIT HEX_DIGIT HEX_DIGIT )
\r
3197 /** \brief Lexer rule generated by ANTLR3
\r
3199 * $ANTLR start UNICODE_ESC
\r
3201 * Looks to match the characters the constitute the token UNICODE_ESC
\r
3202 * from the attached input stream.
\r
3206 * - lexer->error == ANTLR3_TRUE if an exception was thrown.
\r
3208 static ANTLR3_INLINE
\r
3209 void mUNICODE_ESC(pSimanticsDataLexer ctx)
\r
3211 ANTLR3_UINT32 _type;
\r
3214 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:85:5: ( '\\\\' 'u' HEX_DIGIT HEX_DIGIT HEX_DIGIT HEX_DIGIT )
\r
3215 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:85:9: '\\\\' 'u' HEX_DIGIT HEX_DIGIT HEX_DIGIT HEX_DIGIT
\r
3218 if (HASEXCEPTION())
\r
3220 goto ruleUNICODE_ESCEx;
\r
3224 if (HASEXCEPTION())
\r
3226 goto ruleUNICODE_ESCEx;
\r
3229 /* 85:9: '\\\\' 'u' HEX_DIGIT HEX_DIGIT HEX_DIGIT HEX_DIGIT */
\r
3230 mHEX_DIGIT(ctx );
\r
3231 if (HASEXCEPTION())
\r
3233 goto ruleUNICODE_ESCEx;
\r
3236 /* 85:9: '\\\\' 'u' HEX_DIGIT HEX_DIGIT HEX_DIGIT HEX_DIGIT */
\r
3237 mHEX_DIGIT(ctx );
\r
3238 if (HASEXCEPTION())
\r
3240 goto ruleUNICODE_ESCEx;
\r
3243 /* 85:9: '\\\\' 'u' HEX_DIGIT HEX_DIGIT HEX_DIGIT HEX_DIGIT */
\r
3244 mHEX_DIGIT(ctx );
\r
3245 if (HASEXCEPTION())
\r
3247 goto ruleUNICODE_ESCEx;
\r
3250 /* 85:9: '\\\\' 'u' HEX_DIGIT HEX_DIGIT HEX_DIGIT HEX_DIGIT */
\r
3251 mHEX_DIGIT(ctx );
\r
3252 if (HASEXCEPTION())
\r
3254 goto ruleUNICODE_ESCEx;
\r
3262 // This is where rules clean up and exit
\r
3264 goto ruleUNICODE_ESCEx; /* Prevent compiler warnings */
\r
3265 ruleUNICODE_ESCEx: ;
\r
3268 // $ANTLR end UNICODE_ESC
\r
3270 /** This is the entry point in to the lexer from an object that
\r
3271 * wants to generate the next token, such as a pCOMMON_TOKEN_STREAM
\r
3274 mTokens(pSimanticsDataLexer ctx)
\r
3277 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:8: ( T__34 | T__35 | T__36 | T__37 | T__38 | T__39 | T__40 | T__41 | T__42 | T__43 | T__44 | T__45 | T__46 | T__47 | T__48 | T__49 | ID | INT | FLOAT | COMMENT | WS | STRING )
\r
3279 ANTLR3_UINT32 alt22;
\r
3283 alt22 = cdfa22.predict(ctx, RECOGNIZER, ISTREAM, &cdfa22);
\r
3284 if (HASEXCEPTION())
\r
3286 goto ruleTokensEx;
\r
3292 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:10: T__34
\r
3296 if (HASEXCEPTION())
\r
3298 goto ruleTokensEx;
\r
3305 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:16: T__35
\r
3309 if (HASEXCEPTION())
\r
3311 goto ruleTokensEx;
\r
3318 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:22: T__36
\r
3322 if (HASEXCEPTION())
\r
3324 goto ruleTokensEx;
\r
3331 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:28: T__37
\r
3335 if (HASEXCEPTION())
\r
3337 goto ruleTokensEx;
\r
3344 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:34: T__38
\r
3348 if (HASEXCEPTION())
\r
3350 goto ruleTokensEx;
\r
3357 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:40: T__39
\r
3361 if (HASEXCEPTION())
\r
3363 goto ruleTokensEx;
\r
3370 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:46: T__40
\r
3374 if (HASEXCEPTION())
\r
3376 goto ruleTokensEx;
\r
3383 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:52: T__41
\r
3387 if (HASEXCEPTION())
\r
3389 goto ruleTokensEx;
\r
3396 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:58: T__42
\r
3400 if (HASEXCEPTION())
\r
3402 goto ruleTokensEx;
\r
3409 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:64: T__43
\r
3413 if (HASEXCEPTION())
\r
3415 goto ruleTokensEx;
\r
3422 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:70: T__44
\r
3426 if (HASEXCEPTION())
\r
3428 goto ruleTokensEx;
\r
3435 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:76: T__45
\r
3439 if (HASEXCEPTION())
\r
3441 goto ruleTokensEx;
\r
3448 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:82: T__46
\r
3452 if (HASEXCEPTION())
\r
3454 goto ruleTokensEx;
\r
3461 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:88: T__47
\r
3465 if (HASEXCEPTION())
\r
3467 goto ruleTokensEx;
\r
3474 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:94: T__48
\r
3478 if (HASEXCEPTION())
\r
3480 goto ruleTokensEx;
\r
3487 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:100: T__49
\r
3489 /* 1:100: T__49 */
\r
3491 if (HASEXCEPTION())
\r
3493 goto ruleTokensEx;
\r
3500 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:106: ID
\r
3504 if (HASEXCEPTION())
\r
3506 goto ruleTokensEx;
\r
3513 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:109: INT
\r
3517 if (HASEXCEPTION())
\r
3519 goto ruleTokensEx;
\r
3526 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:113: FLOAT
\r
3528 /* 1:113: FLOAT */
\r
3530 if (HASEXCEPTION())
\r
3532 goto ruleTokensEx;
\r
3539 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:119: COMMENT
\r
3541 /* 1:119: COMMENT */
\r
3543 if (HASEXCEPTION())
\r
3545 goto ruleTokensEx;
\r
3552 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:127: WS
\r
3556 if (HASEXCEPTION())
\r
3558 goto ruleTokensEx;
\r
3565 // C:\\Simantics\\workspace\\org.simantics.databoard\\cpp\\DataBoardTest\\DataBoard\\SimanticsData.g:1:130: STRING
\r
3567 /* 1:130: STRING */
\r
3569 if (HASEXCEPTION())
\r
3571 goto ruleTokensEx;
\r
3582 goto ruleTokensEx; /* Prevent compiler warnings */
\r
3586 /* =========================================================================
\r
3587 * Lexer matching rules end.
\r
3588 * =========================================================================
\r
3590 /* End of Lexer code
\r
3591 * ================================================
\r
3592 * ================================================
\r
3597 * =============================================================================
\r