0efca0f644
so it doesn't have to compute it. * src/tgbaparse/tgbascan.ll: Likewise. (YY_USER_INIT, current_file): Remove, it is too costly to use yy::Location::filename in the current implementation of yy::Location (this attribute is duplicated for each token). Leaving it empty divides the parsing time by 3. * src/tgbaparse/fmterror.cc, src/tgbaparse/public.hh (format_tgba_parse_errors): Take the filename as argument. * src/tgbatest/explprod.cc, src/tgbatest/ltl2tgba.cc, src/tgbatest/mixprod.cc, src/tgbatest/powerset.cc, src/tgbatest/readsave.cc, src/tgbatest/reductgba.cc, src/tgbatest/tgbaread.cc, src/tgbatest/tripprod.cc, iface/gspn/dottyssp.cc, iface/gspn/ltlgspn.cc: Adjust calls to format_tgba_parse_errors.
139 lines
4.2 KiB
LLVM
139 lines
4.2 KiB
LLVM
/* Copyright (C) 2003, 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
|
|
** département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
|
** et Marie Curie.
|
|
**
|
|
** This file is part of Spot, a model checking library.
|
|
**
|
|
** Spot is free software; you can redistribute it and/or modify it
|
|
** under the terms of the GNU General Public License as published by
|
|
** the Free Software Foundation; either version 2 of the License, or
|
|
** (at your option) any later version.
|
|
**
|
|
** Spot is distributed in the hope that it will be useful, but WITHOUT
|
|
** ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
** or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
** License for more details.
|
|
**
|
|
** You should have received a copy of the GNU General Public License
|
|
** along with Spot; see the file COPYING. If not, write to the Free
|
|
** Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
** 02111-1307, USA.
|
|
*/
|
|
%option noyywrap
|
|
%option prefix="ltlyy"
|
|
%option outfile="lex.yy.c"
|
|
|
|
%{
|
|
#include <string>
|
|
#include "ltlparse/parsedecl.hh"
|
|
|
|
/* Hack Flex so we read from a string instead of reading from a file. */
|
|
#define YY_INPUT(buf, result, max_size) \
|
|
do { \
|
|
result = (max_size < to_parse_size) ? max_size : to_parse_size; \
|
|
memcpy(buf, to_parse, result); \
|
|
to_parse_size -= result; \
|
|
to_parse += result; \
|
|
} while (0);
|
|
|
|
#define YY_USER_ACTION \
|
|
yylloc->columns(yyleng);
|
|
|
|
static const char* to_parse = 0;
|
|
static size_t to_parse_size = 0;
|
|
|
|
void
|
|
flex_set_buffer(const char* buf)
|
|
{
|
|
to_parse = buf;
|
|
to_parse_size = strlen(to_parse);
|
|
}
|
|
|
|
%}
|
|
|
|
%s not_prop
|
|
|
|
%%
|
|
|
|
%{
|
|
yylloc->step();
|
|
%}
|
|
|
|
"(" BEGIN(0); return PAR_OPEN;
|
|
")" BEGIN(not_prop); return PAR_CLOSE;
|
|
|
|
/* Must go before the other operators, because the F of FALSE
|
|
should not be mistaken with a unary F. */
|
|
"1"|[tT][rR][uU][eE] BEGIN(0); return CONST_TRUE;
|
|
"0"|[fF][aA][lL][sS][eE] BEGIN(0); return CONST_FALSE;
|
|
|
|
|
|
|
|
"!" BEGIN(0); return OP_NOT;
|
|
|
|
/* & and | come from Spin. && and || from LTL2BA.
|
|
/\, \/, and xor are from LBTT.
|
|
*/
|
|
"||"|"|"|"+"|"\\/" BEGIN(0); return OP_OR;
|
|
"&&"|"&"|"."|"*"|"/\\" BEGIN(0); return OP_AND;
|
|
"^"|"xor" BEGIN(0); return OP_XOR;
|
|
"=>"|"->" BEGIN(0); return OP_IMPLIES;
|
|
"<=>"|"<->" BEGIN(0); return OP_EQUIV;
|
|
|
|
/* <>, [], and () are used in Spin. */
|
|
"F"|"<>" BEGIN(0); return OP_F;
|
|
"G"|"[]" BEGIN(0); return OP_G;
|
|
"U" BEGIN(0); return OP_U;
|
|
"R"|"V" BEGIN(0); return OP_R;
|
|
"X"|"()" BEGIN(0); return OP_X;
|
|
|
|
"=0" return OP_POST_NEG;
|
|
"=1" return OP_POST_POS;
|
|
|
|
[ \t\n]+ /* discard whitespace */ yylloc->step ();
|
|
|
|
/* An Atomic proposition cannot start with the letter
|
|
used by a unary operator (F,G,X), unless this
|
|
letter is followed by a digit in which case we assume
|
|
it's an ATOMIC_PROP (even though F0 could be seen as Ffalse, we
|
|
don't, because Ffalse is never used in practice).
|
|
*/
|
|
<INITIAL>[a-zA-EH-WYZ_][a-zA-Z0-9_]* |
|
|
<INITIAL>[FGX][0-9][a-zA-Z0-9_]* |
|
|
/*
|
|
However if we have just parsed an atomic proposition, then we
|
|
are not expecting another atomic proposition, so we can be stricter
|
|
and disallow propositions that start with U, R and V. If you wonder
|
|
why we do this, consider the Wring formula `p=0Uq=1'. When p is
|
|
parsed, we enter the not_prop start condition, we remain into this
|
|
condition when `=0' is processed, and then because we are in this
|
|
condition we will not consider `Uq' as an atomic proposition but as
|
|
a `U' operator followed by a `q' atomic proposition.
|
|
|
|
We also disable atomic proposition that may look a combination
|
|
of a binary operator followed by several unary operators.
|
|
E.g. UFXp. This way, `p=0UFXp=1' will be parsed as `(p=0)U(F(X(p=1)))'.
|
|
*/
|
|
<not_prop>[a-zA-EH-QSTWYZ_][a-zA-EH-WYZ0-9_]* |
|
|
<not_prop>[a-zA-EH-QSTWYZ_][a-zA-EH-WYZ0-9_][a-zA-Z0-9_]* {
|
|
yylval->str = new std::string(yytext, yyleng);
|
|
BEGIN(not_prop);
|
|
return ATOMIC_PROP;
|
|
}
|
|
|
|
/* Atomic propositions can also be enclosed in double quotes. */
|
|
\"[^\"]*\" {
|
|
yylval->str = new std::string(yytext + 1,
|
|
yyleng - 2);
|
|
BEGIN(not_prop);
|
|
return ATOMIC_PROP;
|
|
}
|
|
|
|
. return *yytext;
|
|
|
|
<<EOF>> return END_OF_INPUT;
|
|
|
|
%{
|
|
/* Dummy use of yyunput to shut up a gcc warning. */
|
|
(void) &yyunput;
|
|
%}
|