along/secondo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
dfd1e745480fabd88139d2804acb90d5b6dc055e
secondo/Tools/Parser/SpecParser/SpecParser.tab.cpp
along dfd1e74548 firs commit
2026-01-23 17:03:45 +08:00

2429 lines
79 KiB
C++
Raw Blame History

/* A Bison parser, made by GNU Bison 3.8.2. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 Free Software Foundation,
Inc.
This program 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 3 of the License, or
(at your option) any later version.
This program 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 this program. If not, see <https://www.gnu.org/licenses/>. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
especially those whose name start with YY_ or yy_. They are
private implementation details that can be changed or removed. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
/* Identify Bison output, and Bison version. */
#define YYBISON 30802
/* Bison version string. */
#define YYBISON_VERSION "3.8.2"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Push parsers. */
#define YYPUSH 0
/* Pull parsers. */
#define YYPULL 1
/* First part of user prologue. */
#line 29 "SpecParser.y"
/*
1.0 Includes
*/
#include <iostream>
#include <sstream>
#include <vector>
#include <iostream>
#include <fstream>
#include <set>
#include <cstdlib>
using namespace std;
/*
1.1 Some external defined variables
*/
extern int yylineno;
extern int yylex();
extern FILE* yyin;
/*
1.2 Files for writing the rules
There are four files for writing entries.
*/
ofstream* lexrules;
ofstream* yaccrules1;
ofstream* yaccrules2;
ofstream* tokens;
int tokenslength; // length of the current tokens line
int maxtokenslength = 70;
/*
1.3 A set containing tokens for simple postfix operators
Postfix operators need a special treatment because the different
length of the valuelist. For each different number of arguments before the
operator, a new rule must be inserted and a new token is created. The tokennames
build the content for this set. By looking in the set for already contained
tokens, we can decide whether a rule for this operator already exists.
*/
set<string> simplepostfixtokens;
/*
1.4 Recognition of used Operators
The next two sets collects the names of already used operators as well as
the operatorname together with its pattern. Therewith it is possible
to ignore operators already transformed as well as operators with the
same name but different patterns.
*/
set<string> operatornames;
set<string> opnamesWithPattern;
/*
1.5 Some variables for statistical informations
*/
int processedSpecifications; // number of processed specifications
void removeFiles();
/*
1.4 The error function
This function will be called by the parser in case of an error.
The function writes an error message as well as the line number
which has caused the error to the standard error output.
*/
void yyerror( const char* s )
{
cerr << endl << s << endl << endl;
cerr << "error at line " << yylineno << endl;
removeFiles();
}
/*
1.5 The translation
This structur collects all information needed to construct the
appropriate translation rules.
*/
struct trans{
ostringstream* token;
ostringstream* opname;
ostringstream* pattern;
string alias;
vector<string>* arguments1; // arguments before the operator
vector<string>* arguments2; // arguments after the operator
vector<string>* implicitNames;
vector<string>* implicitTypes;
vector<int>* sublistlengths;
char bracket1; // open bracket after the operator
char bracket2; // close bracket after the operator
bool isSimple;
bool hasfunctions;
bool isPostfix; // postfix notation needs a special treatment
bool bufferForced;
} currenttranslation;
ostream& operator<<(ostream& o, const struct trans& t){
return o << "[" << t.token->str() << ", "
<< t.opname->str() << ", "
<< t.pattern->str() << ", "
<< t.alias << ", "
<< t.isPostfix << ", "
<< t.bufferForced << "]";
}
/*
1.7 ~removeFiles~
Removes all output files.
*/
void removeFiles(){
if(lexrules != NULL){
lexrules->close();
lexrules=0;
}
if(yaccrules1 != NULL){
yaccrules1->close();
yaccrules1=0;
}
if(yaccrules2 != NULL){
yaccrules2->close();
yaccrules2=0;
}
if(tokens != NULL){
tokens->close();
tokens=0;
}
remove("lexrules");
remove("yaccrules1");
remove("yaccrules2");
remove("tokens");
}
/*
1.6 The init function
This function creates all needed variables and sets them to
defined values.
*/
bool init(){
// set the translation to be empty
currenttranslation.token = new ostringstream();
currenttranslation.opname = new ostringstream();
currenttranslation.arguments1 = new vector<string>;
currenttranslation.arguments2 = new vector<string>;
currenttranslation.implicitNames = new vector<string>;
currenttranslation.implicitTypes = new vector<string>;
currenttranslation.sublistlengths = new vector<int>;
currenttranslation.pattern = new ostringstream();
currenttranslation.hasfunctions = false;
currenttranslation.isSimple = true;
currenttranslation.isPostfix = false;
currenttranslation.bufferForced = false;
// initialize outputfiles
lexrules = new ofstream("lexrules");
if(lexrules==NULL)
return false;
yaccrules1 = new ofstream("yaccrules1");
if(yaccrules1==NULL)
return false;
yaccrules2 = new ofstream("yaccrules2");
if(yaccrules2==NULL)
return false;
tokens = new ofstream("tokens");
tokenslength=0; // nothing written to tokens
if(tokens==NULL)
return false;
processedSpecifications=0;
// we need the "=" operator undepending on any algebras
// so it is defined fix in
// the parser. But we have to ignore it and we have to detect
// specification
// different to a standard infix operator
operatornames.insert("=");
opnamesWithPattern.insert("= _infixop_");
return true;
}
/*
1.6 PrintStatistics
This function prints out some statistical information
to the standard output.
*/
void printStatistics(){
cout << " different operators " << operatornames.size() << endl;
cout << " processed specification " << processedSpecifications << endl;
}
/*
1.6 Finalize
This function closes all open files.
*/
bool finalize(){
(*lexrules) << endl;
lexrules->close();
(*yaccrules1) << "\n ;\n\n";
yaccrules1->close();
(*yaccrules2) << endl;
yaccrules2->close();
(*tokens) << endl << endl;
tokens->close();
return true;
}
/*
1.8 reset
The reset function sets all value in the current translation
to the initial values.
*/
void reset(){
currenttranslation.opname->str("");
currenttranslation.token->str("");
currenttranslation.pattern->str("");
currenttranslation.hasfunctions = false;
currenttranslation.isSimple = true;
currenttranslation.isPostfix=false;
currenttranslation.bufferForced = false;
currenttranslation.arguments1->clear();
currenttranslation.arguments2->clear();
currenttranslation.implicitNames->clear();
currenttranslation.implicitTypes->clear();
currenttranslation.sublistlengths->clear();
}
/*
1.9 printtranslation
1.9.1 Print a simple non postfix translation
This function is very easy because all non-postfix
(infix, prefix) operators
can't have any function symbols. All infix and prefix
operators can be handled with standard definitions already
defined in the Parser. The only thing to do is to write a
appropriate rule in the lex specification.
*/
void print_simple_nonpostfix(){
const string opname = currenttranslation.opname->str();
string token = currenttranslation.token->str();
if(token=="ZZPREFIXOP" && !currenttranslation.bufferForced) return;
if(currenttranslation.bufferForced){
token += "_BUF";
}
(*lexrules) << "\"" << opname << "\" ";
(*lexrules) << " { yylval=NestedText::Atom(yytext,yyleng); return ";
(*lexrules) << token << ";}" << endl;
}
/*
1.9.2 print[_]simple[_]postfix
This function prints out a postfix function.
For each different number of arguments (before the operator),
a new rule must be created. A generic rule can't be written
because occuring conflicts in the resulting parser.
*/
void print_simple_postfix(){
const string opname = currenttranslation.opname->str();
string token = currenttranslation.token->str();
int size2=currenttranslation.arguments2->size();
if(size2>0){
token = token + "_a";
}
if(currenttranslation.bufferForced){
token += "_autobuffer";
}
if(simplepostfixtokens.find(token)==simplepostfixtokens.end()){
/*
The rule is not created in this case, we make entries in the
files rules and yaccrules1.
*/
simplepostfixtokens.insert(token);
// write token
int len = token.size();
if(tokenslength + len > maxtokenslength){
(*tokens) << endl;
tokenslength = 0;
}
tokenslength += len;
(*tokens) << token << " ";
// write rule
(*yaccrules1) << endl << "/*" << endl
<< "~token~" << endl
<< endl << "*/" << endl;
(*yaccrules1) << "\n | " ;
int size = currenttranslation.arguments1->size();
for(int i=0;i<size;i++){
string arg = (*currenttranslation.arguments1)[i];
(*yaccrules1) << arg << " " << endl;
}
(*yaccrules1) << token ;
if(size2!=0){
(*yaccrules1) << "'[' simplearguments ']'\n" ;
}
/* write the translation */
string space = "NestedText::AtomC(\" \")";
(*yaccrules1) << " { $$ =" << endl;
(*yaccrules1) << " NestedText::Concat( " << endl;
if(currenttranslation.bufferForced) {
(*yaccrules1) << " (USE_AUTO_BUFFER? NestedText::AtomC(\"( ! (\")"
" : NestedText::AtomC(\"(\")) ," << endl;
} else {
(*yaccrules1) << " NestedText::AtomC(\"(\")," << endl;
}
(*yaccrules1) << " NestedText::Concat( $"
<< (size+1)
<< "," << endl;
// write the arguments before the operator
for(int i=0; i<size;i++){
(*yaccrules1) << " NestedText::Concat(" << space << "," << endl;
(*yaccrules1) << " NestedText::Concat( $" << (i+1) << ","
<< endl;
}
if(size2>0){
(*yaccrules1) << " NestedText::Concat(NestedText::AtomC(\" \"),"
<< endl;
(*yaccrules1) << " NestedText::Concat( $" << (size+3) << ","
<< endl;
}
if(currenttranslation.bufferForced){
(*yaccrules1) << " (USE_AUTO_BUFFER? NestedText::AtomC(\"))\")";
(*yaccrules1) << " : NestedText::AtomC(\")\"))";
}else{
(*yaccrules1) << " NestedText::AtomC(\")\")";
}
for(int i=0;i< size;i++){
(*yaccrules1) << "))";
}
if(size2>0){
(*yaccrules1) << "))";
}
(*yaccrules1) << "));";
(*yaccrules1) << " }\n";
}
// write the rule for lex
(*lexrules) << "\"" << opname << "\" ";
(*lexrules) << " { yylval=NestedText::Atom(yytext,yyleng); return ";
(*lexrules) << token << ";}" << endl;
}
/*
1.9.3 print[_]complex[_]postfix[_]without implicit parameters
This function is called when a postfix operator including 'fun' or
'funlist' is be found and the implicit parameter list is empty.
*/
void print_complex_postfix_without_implicit_parameters(){
const string opname = currenttranslation.opname->str();
/* Found an operator with function arguments */
// define a new token from the alias
string newtoken = currenttranslation.alias;
newtoken = "ZZ"+newtoken;
int len = newtoken.size()+1;
if(tokenslength+len > maxtokenslength){
tokenslength = 0;
(*tokens) << endl;
}
tokenslength += len;
// write it into the tokens file
(*tokens) << newtoken << " ";
// write a lexrule
(*lexrules) << "\"" << opname << "\" ";
(*lexrules) << " { yylval=NestedText::Atom(yytext,yyleng); return ";
(*lexrules) << newtoken << ";}" << endl;
// write the pattern for this function
(*yaccrules1) << endl << "/*" << endl
<< "~token~" << endl
<< endl << "*/" << endl;
(*yaccrules1) << "\n | ";
int size1 = currenttranslation.arguments1->size();
// write the leading (simple) arguments
for(int i=0;i<size1;i++)
(*yaccrules1) << ((*currenttranslation.arguments1)[i])
<< " " << endl;
(*yaccrules1) << newtoken << "'[' ";
int size2 = currenttranslation.arguments2->size();
// position of this argument in the pattern
int positions[currenttranslation.arguments2->size()];
int separators = 0; // number of ';'
// = length of the first sublist
int nextseparator = (*currenttranslation.sublistlengths)[0];
for(int i=0;i<size2;i++){
if(i==nextseparator){ // end of this sublist
// write separator into the pattern
(*yaccrules1) << " ';' " << endl;
separators++;
nextseparator = i+(*currenttranslation.sublistlengths)[separators];
}
positions[i] = size1+3+ i*2;
string arg =((*currenttranslation.arguments2)[i]);
if(arg=="funlist")
arg = "list";
(*yaccrules1) << arg << endl;
if(i!=nextseparator-1)
(*yaccrules1) << "',' " << endl << " ";
}
(*yaccrules1) << " ']'" << endl;
// write the translation
string space = "NestedText::AtomC(\" \")";
(*yaccrules1) << " { $$ =";
(*yaccrules1) << " NestedText::Concat( " << endl;
if(currenttranslation.bufferForced){
(*yaccrules1) << " (USE_AUTO_BUFFER?NestedText::AtomC(\"( ! (\")"
" :NestedText::AtomC(\"(\"))," << endl;
} else {
(*yaccrules1) << " NestedText::AtomC(\"(\")," << endl;
}
(*yaccrules1) << " NestedText::Concat( $"
<< (size1+1)
<< "," << endl; // operatortoken
for(int i=0; i<size1;i++){ // arguments before operator
(*yaccrules1) << " NestedText::Concat(" << space << "," << endl;
(*yaccrules1) << " NestedText::Concat( $" << (i+1) << "," << endl;
}
for(int i=0; i<size2; i++){
(*yaccrules1) << " NestedText::Concat(" << space << "," << endl;
(*yaccrules1) << " NestedText::Concat( $" << positions[i] << ",";
}
if(currenttranslation.bufferForced){
(*yaccrules1) << " (USE_AUTO_BUFFER?NestedText::AtomC(\"))\")"
" :NestedText::AtomC(\")\")))";
} else {
(*yaccrules1) << " NestedText::AtomC(\")\"))";
}
for(int i=0;i< size1+size2;i++){
(*yaccrules1) << "))";
}
(*yaccrules1) << ");";
(*yaccrules1) << " }\n";
}
/*
1.9.4 print[_]complex[_]postfix
This function handles postfix operators including functions
and implicit parameters. We build a new token as well as one
or two new yacc rules to handle such operators.
*/
void print_complex_postfix(){
string token = "ZZ" + currenttranslation.alias;
string opname = currenttranslation.opname->str();
// write to the tokens file
int len = token.size()+1;
if(tokenslength+len>maxtokenslength){
tokenslength = 0;
(*tokens) << endl;
}
tokenslength += len;
(*tokens) << token << " ";
// write rule for lex
(*lexrules) << "\"" << opname << "\" ";
(*lexrules) << " { yylval=NestedText::Atom(yytext,yyleng); return ";
(*lexrules) << token << ";}" << endl;
// build the string for functions from the implicit parameters
int sizei = currenttranslation.implicitNames->size();
if(sizei>9){
cerr << " Error: too many implicit parameters at line "
<< yylineno << endl;
cerr << " allowed numbe is 9, found " << sizei << " ones " << endl;
cerr << " The operator is " << opname << endl;
removeFiles();
exit(1);
}
string funname = currenttranslation.alias+"_fun";
string funlistname = funname+"list";
// write the rule for yacc
(*yaccrules1) << endl << "/*" << endl
<< "~token~" << endl
<< endl << "*/" << endl;
(*yaccrules1) << "\n | ";
// write leading arguments
int size1 = currenttranslation.arguments1->size();
for(int i=0;i<size1;i++){
(*yaccrules1) << (*currenttranslation.arguments1)[i] << " " << endl;
}
// write the operatortoken
(*yaccrules1) << token << " ";
// write the argumentlist, count the separators
bool fun_used = false;
bool funlist_used = false;
int separators = 0;
int positions[currenttranslation.arguments2->size()];
int nextseparator = (*currenttranslation.sublistlengths)[separators];
(*yaccrules1) << "'[' ";
int size2 = currenttranslation.arguments2->size();
for(int i=0;i<size2;i++){
if(i==nextseparator) { // end of a sublist
(*yaccrules1) << "';' " << endl;
separators++;
nextseparator=i+(*currenttranslation.sublistlengths)[separators];
}
positions[i] = size1 + 3 + 2*i;
string arg = (*currenttranslation.arguments2)[i];
if(arg == "fun"){
fun_used = true;
arg = funname;
} else if(arg == "funlist"){
funlist_used=true;
arg = funlistname;
}
(*yaccrules1) << arg << endl;
if( (i+1) != nextseparator)
(*yaccrules1) << "',' " << endl;
}
(*yaccrules1) << " ']' \n ";
// write the translation scheme
string space = "NestedText::AtomC(\" \")";
(*yaccrules1) << " { $$ =";
(*yaccrules1) << " NestedText::Concat( " << endl;
if(currenttranslation.bufferForced){
(*yaccrules1) << " (USE_AUTO_BUFFER?NestedText::AtomC(\"( ! (\")"
" :NestedText::AtomC(\"(\")),"
<< endl;
} else {
(*yaccrules1) << " NestedText::AtomC(\"(\")," << endl;
}
(*yaccrules1) << " NestedText::Concat( $" << (size1+1) << "," << endl;
for(int i=0; i<size1;i++){ // arguments before operator
(*yaccrules1) << " NestedText::Concat(" << space << "," << endl;
(*yaccrules1) << " NestedText::Concat( $" << (i+1) << "," << endl;
}
for(int i=0; i<size2; i++){
(*yaccrules1) << " NestedText::Concat(" << space << "," << endl;
(*yaccrules1) << " NestedText::Concat( $" << positions[i] << ","
<< endl;
}
if(currenttranslation.bufferForced){
(*yaccrules1) << " (USE_AUTO_BUFFER?NestedText::AtomC(\"))\")"
" :NestedText::AtomC(\")\")))"
<< endl;
} else {
(*yaccrules1) << " NestedText::AtomC(\")\"))" << endl;
}
for(int i=0;i< size1+size2;i++){
(*yaccrules1) << "))";
}
(*yaccrules1) << ");";
(*yaccrules1) << " }\n";
if(funlist_used) { // without a function list wo
// don't allow naming of functions
// print the rule for the function to yaccrules 2
(*yaccrules2) << endl << "/*" << endl
<< "~Function~" << endl
<< endl << "*/" << endl;
// case 1 a named function
(*yaccrules2) << funname << ": naming "<< funname << "_1" << endl;
(*yaccrules2) << " ";
if(currenttranslation.bufferForced){
(*yaccrules2) << "{$$ = NestedText::Concat( "
<< " (USE_AUTO_BUFFER?NestedText::AtomC(\"( ! (\")"
<< " :NestedText::AtomC(\"(\")), ";
} else {
(*yaccrules2) << "{$$ = NestedText::Concat(NestedText::AtomC(\"(\"), ";
}
(*yaccrules2) << endl;
(*yaccrules2) << " NestedText::Concat($1, " << endl;
(*yaccrules2) << " "
<< "NestedText::Concat(NestedText::AtomC(\" \"),"
<< endl;
(*yaccrules2) << " NestedText::Concat($2, " << endl;
if(currenttranslation.bufferForced){
(*yaccrules2) << " (USE_AUTO_BUFFER?NestedText::AtomC(\"))\")"
<< " :NestedText::AtomC(\")\"))"
<< " ))));} " << endl;
} else {
(*yaccrules2) << " NestedText::AtomC(\")\") ))));} " << endl;
}
// case 2: a named function with default value
(*yaccrules2) << " | naming "<< funname << "_1 ZZDEFAULTSEP valueexpr" << endl;
(*yaccrules2) << " ";
if(currenttranslation.bufferForced){
(*yaccrules2) << "{$$ = NestedText::Concat( "
<< " (USE_AUTO_BUFFER?NestedText::AtomC(\"( ! (\")"
<< " :NestedText::AtomC(\"(\")), ";
} else {
(*yaccrules2) << "{$$ = NestedText::Concat(NestedText::AtomC(\"(\"), ";
}
(*yaccrules2) << endl;
(*yaccrules2) << " NestedText::Concat($1, " << endl;
(*yaccrules2) << " "
<< "NestedText::Concat(NestedText::AtomC(\" \"),"
<< endl;
(*yaccrules2) << " NestedText::Concat($2, " << endl;
(*yaccrules2) << " NestedText::Concat(NestedText::AtomC(\" \"),";
(*yaccrules2) << " NestedText::Concat( $4 ,";
if(currenttranslation.bufferForced){
(*yaccrules2) << " (USE_AUTO_BUFFER?NestedText::AtomC(\"))\")"
<< " :NestedText::AtomC(\")\"))"
<< " ))))));} " << endl;
} else {
(*yaccrules2) << " NestedText::AtomC(\")\") ))))));} " << endl;
}
// case 3: unnamed function
(*yaccrules2) << " | " << funname << "_1 {$$ = $1;} " << endl;
// case 4: unnamed function with default value
(*yaccrules2) << " | " << funname << "_1 ZZDEFAULTSEP valueexpr " << endl;
(*yaccrules2) << " {$$ = NestedText::Concat($1, NestedText::Concat(NestedText::AtomC(\" \"), $3));";
(*yaccrules2) << " } " << endl;
(*yaccrules2) << " ; " << endl;
}
string extension = funlist_used? "_1":"";
// write the real function scheme
(*yaccrules2) << endl << "/*" << endl
<< "~function~" << endl
<< endl << "*/" << endl;
(*yaccrules2) << funname << extension << " : { " << endl;
(*yaccrules2) << " pair<int,string> p; " << endl;
for(int i=0;i<sizei;i++){ // put own variables on stack
(*yaccrules2) << " paramno++; " << endl;
(*yaccrules2) << " strcpy(paramname,\"";
(*yaccrules2) << (*currenttranslation.implicitNames)[i] << "\");"
<< endl;
(*yaccrules2) << " sprintf(params[" << (i+1) <<"]"
<< ", \"%s_%d\",paramname,paramno);"
<< endl;
(*yaccrules2) << " p = pair<int,string>("<< (i+1) << ", params[" << (i+1) << "]);" << endl;
(*yaccrules2) << " paramstack.push(p);" << endl;
}
(*yaccrules2) << " }" << endl;
(*yaccrules2) << " valueexpr" << endl;
(*yaccrules2) << " { " << endl;
(*yaccrules2) << " pair<int,string> p; " << endl;
for(int i=sizei;i>0;i--){ // remove own variables from stack
(*yaccrules2) << " p = paramstack.top(); " << endl;
(*yaccrules2) << " strcpy(params[p.first],p.second.c_str());" << endl;
(*yaccrules2) << " paramstack.pop();" << endl;
}
(*yaccrules2) << " "
<< "$$ = NestedText::Concat( NestedText::AtomC(\"(fun \"),"
<< endl;
for(int i=0; i< sizei ; i++){
(*yaccrules2) << " NestedText::Concat( NestedText::AtomC(\"(\"),"
<< endl;
(*yaccrules2) << " NestedText::Concat( NestedText::AtomC(params["
<< (i+1) << "]),"
<< endl;
(*yaccrules2) << " NestedText::Concat( NestedText::AtomC(\"";
(*yaccrules2) << " " << ((*currenttranslation.implicitTypes)[i])
<< "\")," << endl;
(*yaccrules2) << " NestedText::Concat(NestedText::AtomC(\")\"),"
<< endl;
}
(*yaccrules2) << " "
<< "NestedText::Concat( $2, NestedText::AtomC(\")\")))";
for(int i=0;i<sizei;i++){
(*yaccrules2) << " ))))";
}
(*yaccrules2) << ";" << endl;
// delete values of all parameters or restore the old values
(*yaccrules2) << " cleanVariables("<<sizei<<"); " << endl;
(*yaccrules2) << " restoreVariables(); " << endl;
(*yaccrules2) << " }" << endl;
(*yaccrules2) << " | function { $$ = $1; } " << endl;
(*yaccrules2) << " ;\n";
if(funlist_used) {
// rule for making bracket around the funlist
(*yaccrules2) << endl << "/*" << endl
<< "~funlist~" << endl
<< endl << "*/" << endl;
(*yaccrules2) << funlistname << ": " << funlistname << "_1 " << endl;
(*yaccrules2) << " "
<< "{ $$=NestedText::Concat(NestedText::AtomC(\"( \"),"
<< endl;
(*yaccrules2) << " NestedText::Concat($1, " << endl;
(*yaccrules2) << " NestedText::AtomC(\" ) \")));"
<< endl;
(*yaccrules2) << " } " << endl;
(*yaccrules2) << " ; " << endl;
// the funlist itself
(*yaccrules2) << endl << "/*" << endl
<< "~funlist~" << endl
<< endl << "*/" << endl;
(*yaccrules2) << funlistname << "_1 : "<< funname << "{$$ = $1;}"
<< endl; // one elem list
(*yaccrules2) << " | " << funlistname << "_1 ',' "
<< funname << endl; // composite list
(*yaccrules2) << " { $$ = NestedText::Concat($1," << endl;
(*yaccrules2) << " "
<< "NestedText::Concat(NestedText::AtomC(\" \"), $3));"
<< endl;
(*yaccrules2) << " }" << endl;
(*yaccrules2) << " ; \n";
}
}
/*
This function creates rules for les and yacc from the information stored in the
current translation. The rules are stored in the appropriate files.
*/
void printtranslation(){
const string opname = currenttranslation.opname->str();
const string token = currenttranslation.token->str();
if(currenttranslation.isSimple && ! currenttranslation.isPostfix){
print_simple_nonpostfix();
} else if(currenttranslation.isSimple){
print_simple_postfix();
}
else{
int implicitNamesSize = currenttranslation.implicitNames->size();
int implicitTypesSize = currenttranslation.implicitTypes->size();
if(implicitNamesSize!=implicitTypesSize){
cerr << " error in line " << yylineno << endl;
cerr << ("Different sizes for implicit names and types ");
cerr << " Names : ";
for(int i=0;i<implicitNamesSize;i++)
cerr << ((*currenttranslation.implicitNames)[i]) << endl;
cerr << " Types : ";
for(int i=0;i<implicitTypesSize;i++)
cerr << ((*currenttranslation.implicitTypes)[i]) << endl;
finalize();
removeFiles();
exit(1);
}
if(implicitNamesSize==0){ // without implicite parameters
print_complex_postfix_without_implicit_parameters();
} else{ // operator with implicit parameters
print_complex_postfix();
}
}
}
#line 868 "SpecParser.tab.cpp"
# ifndef YY_CAST
# ifdef __cplusplus
# define YY_CAST(Type, Val) static_cast<Type> (Val)
# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
# else
# define YY_CAST(Type, Val) ((Type) (Val))
# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
# endif
# endif
# ifndef YY_NULLPTR
# if defined __cplusplus
# if 201103L <= __cplusplus
# define YY_NULLPTR nullptr
# else
# define YY_NULLPTR 0
# endif
# else
# define YY_NULLPTR ((void*)0)
# endif
# endif
#include "SpecParser.tab.hpp"
/* Symbol kind. */
enum yysymbol_kind_t
{
YYSYMBOL_YYEMPTY = -2,
YYSYMBOL_YYEOF = 0, /* "end of file" */
YYSYMBOL_YYerror = 1, /* error */
YYSYMBOL_YYUNDEF = 2, /* "invalid token" */
YYSYMBOL_ZZOPERATOR = 3, /* ZZOPERATOR */
YYSYMBOL_ZZPATTERN = 4, /* ZZPATTERN */
YYSYMBOL_ZZFUN = 5, /* ZZFUN */
YYSYMBOL_ZZOP = 6, /* ZZOP */
YYSYMBOL_ZZINFIXOP = 7, /* ZZINFIXOP */
YYSYMBOL_ZZLIST = 8, /* ZZLIST */
YYSYMBOL_ZZIMPLICIT = 9, /* ZZIMPLICIT */
YYSYMBOL_ZZPARAMETER = 10, /* ZZPARAMETER */
YYSYMBOL_ZZPARAMETERS = 11, /* ZZPARAMETERS */
YYSYMBOL_ZZTYPE = 12, /* ZZTYPE */
YYSYMBOL_ZZTYPES = 13, /* ZZTYPES */
YYSYMBOL_ZZFUNLIST = 14, /* ZZFUNLIST */
YYSYMBOL_ZZCOMMENT = 15, /* ZZCOMMENT */
YYSYMBOL_ZZFORCEBUFFER = 16, /* ZZFORCEBUFFER */
YYSYMBOL_ZZIDENTIFIER = 17, /* ZZIDENTIFIER */
YYSYMBOL_ZZSYMBOL = 18, /* ZZSYMBOL */
YYSYMBOL_ZZALIAS = 19, /* ZZALIAS */
YYSYMBOL_20___ = 20, /* '_' */
YYSYMBOL_21_ = 21, /* '(' */
YYSYMBOL_22_ = 22, /* ')' */
YYSYMBOL_23_ = 23, /* '[' */
YYSYMBOL_24_ = 24, /* ']' */
YYSYMBOL_25_ = 25, /* ',' */
YYSYMBOL_26_ = 26, /* ';' */
YYSYMBOL_YYACCEPT = 27, /* $accept */
YYSYMBOL_specfile = 28, /* specfile */
YYSYMBOL_specs = 29, /* specs */
YYSYMBOL_spec = 30, /* spec */
YYSYMBOL_name = 31, /* name */
YYSYMBOL_pattern = 32, /* pattern */
YYSYMBOL_infix = 33, /* infix */
YYSYMBOL_prefix = 34, /* prefix */
YYSYMBOL_postfix = 35, /* postfix */
YYSYMBOL_simpleargscomma = 36, /* simpleargscomma */
YYSYMBOL_simpleargsblank = 37, /* simpleargsblank */
YYSYMBOL_arguments = 38, /* arguments */
YYSYMBOL_sublist = 39, /* sublist */
YYSYMBOL_argscomma = 40, /* argscomma */
YYSYMBOL_arg = 41, /* arg */
YYSYMBOL_implicit = 42, /* implicit */
YYSYMBOL_rest = 43, /* rest */
YYSYMBOL_bufferforced = 44, /* bufferforced */
YYSYMBOL_parameterlist = 45, /* parameterlist */
YYSYMBOL_typelist = 46 /* typelist */
};
typedef enum yysymbol_kind_t yysymbol_kind_t;
#ifdef short
# undef short
#endif
/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
<limits.h> and (if available) <stdint.h> are included
so that the code can choose integer types of a good width. */
#ifndef __PTRDIFF_MAX__
# include <limits.h> /* INFRINGES ON USER NAME SPACE */
# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
# include <stdint.h> /* INFRINGES ON USER NAME SPACE */
# define YY_STDINT_H
# endif
#endif
/* Narrow types that promote to a signed type and that can represent a
signed or unsigned integer of at least N bits. In tables they can
save space and decrease cache pressure. Promoting to a signed type
helps avoid bugs in integer arithmetic. */
#ifdef __INT_LEAST8_MAX__
typedef __INT_LEAST8_TYPE__ yytype_int8;
#elif defined YY_STDINT_H
typedef int_least8_t yytype_int8;
#else
typedef signed char yytype_int8;
#endif
#ifdef __INT_LEAST16_MAX__
typedef __INT_LEAST16_TYPE__ yytype_int16;
#elif defined YY_STDINT_H
typedef int_least16_t yytype_int16;
#else
typedef short yytype_int16;
#endif
/* Work around bug in HP-UX 11.23, which defines these macros
incorrectly for preprocessor constants. This workaround can likely
be removed in 2023, as HPE has promised support for HP-UX 11.23
(aka HP-UX 11i v2) only through the end of 2022; see Table 2 of
<https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>. */
#ifdef __hpux
# undef UINT_LEAST8_MAX
# undef UINT_LEAST16_MAX
# define UINT_LEAST8_MAX 255
# define UINT_LEAST16_MAX 65535
#endif
#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
typedef __UINT_LEAST8_TYPE__ yytype_uint8;
#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
&& UINT_LEAST8_MAX <= INT_MAX)
typedef uint_least8_t yytype_uint8;
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
typedef unsigned char yytype_uint8;
#else
typedef short yytype_uint8;
#endif
#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
typedef __UINT_LEAST16_TYPE__ yytype_uint16;
#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
&& UINT_LEAST16_MAX <= INT_MAX)
typedef uint_least16_t yytype_uint16;
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
typedef unsigned short yytype_uint16;
#else
typedef int yytype_uint16;
#endif
#ifndef YYPTRDIFF_T
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
# define YYPTRDIFF_T __PTRDIFF_TYPE__
# define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
# elif defined PTRDIFF_MAX
# ifndef ptrdiff_t
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# endif
# define YYPTRDIFF_T ptrdiff_t
# define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
# else
# define YYPTRDIFF_T long
# define YYPTRDIFF_MAXIMUM LONG_MAX
# endif
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned
# endif
#endif
#define YYSIZE_MAXIMUM \
YY_CAST (YYPTRDIFF_T, \
(YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \
? YYPTRDIFF_MAXIMUM \
: YY_CAST (YYSIZE_T, -1)))
#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
/* Stored state numbers (used for stacks). */
typedef yytype_int8 yy_state_t;
/* State numbers in computations. */
typedef int yy_state_fast_t;
#ifndef YY_
# if defined YYENABLE_NLS && YYENABLE_NLS
# if ENABLE_NLS
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
# define YY_(Msgid) dgettext ("bison-runtime", Msgid)
# endif
# endif
# ifndef YY_
# define YY_(Msgid) Msgid
# endif
#endif
#ifndef YY_ATTRIBUTE_PURE
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
# else
# define YY_ATTRIBUTE_PURE
# endif
#endif
#ifndef YY_ATTRIBUTE_UNUSED
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
# else
# define YY_ATTRIBUTE_UNUSED
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YY_USE(E) ((void) (E))
#else
# define YY_USE(E) /* empty */
#endif
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
#if defined __GNUC__ && ! defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__
# if __GNUC__ * 100 + __GNUC_MINOR__ < 407
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")
# else
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# endif
# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
_Pragma ("GCC diagnostic pop")
#else
# define YY_INITIAL_VALUE(Value) Value
#endif
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
#endif
#ifndef YY_INITIAL_VALUE
# define YY_INITIAL_VALUE(Value) /* Nothing. */
#endif
#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
# define YY_IGNORE_USELESS_CAST_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
# define YY_IGNORE_USELESS_CAST_END \
_Pragma ("GCC diagnostic pop")
#endif
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_END
#endif
#define YY_ASSERT(E) ((void) (0 && (E)))
#if !defined yyoverflow
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
/* Use EXIT_SUCCESS as a witness for stdlib.h. */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's 'empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
# ifndef YYSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define YYSTACK_ALLOC YYMALLOC
# define YYSTACK_FREE YYFREE
# ifndef YYSTACK_ALLOC_MAXIMUM
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined EXIT_SUCCESS \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined EXIT_SUCCESS
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined EXIT_SUCCESS
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* !defined yyoverflow */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yy_state_t yyss_alloc;
YYSTYPE yyvs_alloc;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \
+ YYSTACK_GAP_MAXIMUM)
# define YYCOPY_NEEDED 1
/* Relocate STACK from its old location to the new one. The
local variables YYSIZE and YYSTACKSIZE give the old and new number of
elements in the stack, and YYPTR gives the new location of the
stack. Advance YYPTR to a properly aligned location for the next
stack. */
# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
do \
{ \
YYPTRDIFF_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / YYSIZEOF (*yyptr); \
} \
while (0)
#endif
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
/* Copy COUNT objects from SRC to DST. The source and destination do
not overlap. */
# ifndef YYCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define YYCOPY(Dst, Src, Count) \
__builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
# else
# define YYCOPY(Dst, Src, Count) \
do \
{ \
YYPTRDIFF_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(Dst)[yyi] = (Src)[yyi]; \
} \
while (0)
# endif
# endif
#endif /* !YYCOPY_NEEDED */
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 9
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 51
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 27
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 20
/* YYNRULES -- Number of rules. */
#define YYNRULES 41
/* YYNSTATES -- Number of states. */
#define YYNSTATES 66
/* YYMAXUTOK -- Last valid token kind. */
#define YYMAXUTOK 274
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
as returned by yylex, with out-of-bounds checking. */
#define YYTRANSLATE(YYX) \
(0 <= (YYX) && (YYX) <= YYMAXUTOK \
? YY_CAST (yysymbol_kind_t, yytranslate[YYX]) \
: YYSYMBOL_YYUNDEF)
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
as returned by yylex. */
static const yytype_int8 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,
21, 22, 2, 2, 25, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 26,
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, 23, 2, 24, 2, 20, 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, 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, 2, 3, 4,
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19
};
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_int16 yyrline[] =
{
0, 842, 842, 843, 846, 847, 848, 849, 852, 882,
884, 889, 890, 891, 896, 903, 912, 921, 930, 958,
960, 964, 968, 974, 975, 978, 981, 986, 993, 995,
999, 1002, 1008, 1022, 1025, 1026, 1029, 1032, 1036, 1039,
1043, 1046
};
#endif
/** Accessing symbol of state STATE. */
#define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])
#if YYDEBUG || 0
/* The user-facing name of the symbol whose (internal) number is
YYSYMBOL. No bounds checking. */
static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"\"end of file\"", "error", "\"invalid token\"", "ZZOPERATOR",
"ZZPATTERN", "ZZFUN", "ZZOP", "ZZINFIXOP", "ZZLIST", "ZZIMPLICIT",
"ZZPARAMETER", "ZZPARAMETERS", "ZZTYPE", "ZZTYPES", "ZZFUNLIST",
"ZZCOMMENT", "ZZFORCEBUFFER", "ZZIDENTIFIER", "ZZSYMBOL", "ZZALIAS",
"'_'", "'('", "')'", "'['", "']'", "','", "';'", "$accept", "specfile",
"specs", "spec", "name", "pattern", "infix", "prefix", "postfix",
"simpleargscomma", "simpleargsblank", "arguments", "sublist",
"argscomma", "arg", "implicit", "rest", "bufferforced", "parameterlist",
"typelist", YY_NULLPTR
};
static const char *
yysymbol_name (yysymbol_kind_t yysymbol)
{
return yytname[yysymbol];
}
#endif
#define YYPACT_NINF (-14)
#define yypact_value_is_default(Yyn) \
((Yyn) == YYPACT_NINF)
#define YYTABLE_NINF (-1)
#define yytable_value_is_error(Yyn) \
0
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
static const yytype_int8 yypact[] =
{
5, 13, -14, 6, 7, -14, -14, -14, -12, -14,
-14, -14, 4, 20, -2, 14, 10, 19, -14, -14,
-14, -1, -9, 16, 22, 18, 15, -14, -14, -14,
1, -14, 23, 23, -14, -14, -14, -5, -14, 17,
-14, 0, -11, -14, -14, -14, -14, 3, -14, 21,
-14, -14, 24, 25, 24, -14, -5, -4, -14, 26,
-14, 26, -14, -14, 27, -14
};
/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
Performed when YYTABLE does not specify something else to do. Zero
means the default is an error. */
static const yytype_int8 yydefact[] =
{
3, 0, 5, 0, 2, 4, 9, 10, 0, 1,
7, 6, 0, 0, 0, 0, 21, 33, 12, 11,
13, 0, 0, 0, 0, 37, 17, 22, 19, 16,
0, 14, 0, 0, 32, 36, 8, 0, 15, 0,
38, 0, 0, 31, 26, 27, 30, 0, 23, 25,
28, 20, 0, 0, 0, 18, 0, 0, 40, 34,
39, 35, 24, 29, 0, 41
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int8 yypgoto[] =
{
-14, -14, -14, 35, -14, -14, -14, -14, -14, -14,
-14, -14, -13, -14, -10, -14, -14, -14, 12, -6
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int8 yydefgoto[] =
{
0, 3, 4, 5, 8, 17, 18, 19, 20, 30,
21, 47, 48, 49, 50, 25, 34, 36, 41, 59
};
/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule whose
number is the opposite. If YYTABLE_NINF, syntax error. */
static const yytype_int8 yytable[] =
{
43, 43, 54, 44, 15, 26, 9, 12, 1, 45,
1, 28, 52, 29, 53, 46, 46, 23, 16, 27,
2, 13, 10, 38, 14, 53, 39, 55, 24, 56,
6, 7, 32, 33, 35, 22, 31, 51, 37, 11,
40, 58, 60, 62, 65, 42, 57, 63, 61, 0,
0, 64
};
static const yytype_int8 yycheck[] =
{
5, 5, 13, 8, 6, 6, 0, 19, 3, 14,
3, 20, 12, 22, 25, 20, 20, 7, 20, 20,
15, 17, 15, 22, 4, 25, 25, 24, 9, 26,
17, 18, 10, 11, 16, 21, 20, 20, 23, 4,
17, 17, 17, 56, 17, 33, 25, 57, 54, -1,
-1, 25
};
/* YYSTOS[STATE-NUM] -- The symbol kind of the accessing symbol of
state STATE-NUM. */
static const yytype_int8 yystos[] =
{
0, 3, 15, 28, 29, 30, 17, 18, 31, 0,
15, 30, 19, 17, 4, 6, 20, 32, 33, 34,
35, 37, 21, 7, 9, 42, 6, 20, 20, 22,
36, 20, 10, 11, 43, 16, 44, 23, 22, 25,
17, 45, 45, 5, 8, 14, 20, 38, 39, 40,
41, 20, 12, 25, 13, 24, 26, 25, 17, 46,
17, 46, 39, 41, 25, 17
};
/* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM. */
static const yytype_int8 yyr1[] =
{
0, 27, 28, 28, 29, 29, 29, 29, 30, 31,
31, 32, 32, 32, 33, 34, 34, 35, 35, 36,
36, 37, 37, 38, 38, 39, 39, 39, 40, 40,
41, 41, 42, 42, 43, 43, 44, 44, 45, 45,
46, 46
};
/* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM. */
static const yytype_int8 yyr2[] =
{
0, 2, 1, 0, 1, 1, 2, 2, 8, 1,
1, 1, 1, 1, 3, 4, 3, 2, 5, 1,
3, 1, 2, 1, 3, 1, 1, 1, 1, 3,
1, 1, 2, 0, 4, 4, 1, 0, 1, 3,
1, 3
};
enum { YYENOMEM = -2 };
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrorlab
#define YYNOMEM goto yyexhaustedlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY) \
{ \
yychar = (Token); \
yylval = (Value); \
YYPOPSTACK (yylen); \
yystate = *yyssp; \
goto yybackup; \
} \
else \
{ \
yyerror (YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (0)
/* Backward compatibility with an undocumented macro.
Use YYerror or YYUNDEF. */
#define YYERRCODE YYUNDEF
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (0)
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Kind, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (0)
/*-----------------------------------.
| Print this symbol's value on YYO. |
`-----------------------------------*/
static void
yy_symbol_value_print (FILE *yyo,
yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
{
FILE *yyoutput = yyo;
YY_USE (yyoutput);
if (!yyvaluep)
return;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YY_USE (yykind);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/*---------------------------.
| Print this symbol on YYO. |
`---------------------------*/
static void
yy_symbol_print (FILE *yyo,
yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
{
YYFPRINTF (yyo, "%s %s (",
yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));
yy_symbol_value_print (yyo, yykind, yyvaluep);
YYFPRINTF (yyo, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
static void
yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop)
{
YYFPRINTF (stderr, "Stack now");
for (; yybottom <= yytop; yybottom++)
{
int yybot = *yybottom;
YYFPRINTF (stderr, " %d", yybot);
}
YYFPRINTF (stderr, "\n");
}
# define YY_STACK_PRINT(Bottom, Top) \
do { \
if (yydebug) \
yy_stack_print ((Bottom), (Top)); \
} while (0)
/*------------------------------------------------.
| Report that the YYRULE is going to be reduced. |
`------------------------------------------------*/
static void
yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp,
int yyrule)
{
int yylno = yyrline[yyrule];
int yynrhs = yyr2[yyrule];
int yyi;
YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr,
YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]),
&yyvsp[(yyi + 1) - (yynrhs)]);
YYFPRINTF (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyssp, yyvsp, Rule); \
} while (0)
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args) ((void) 0)
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
static void
yydestruct (const char *yymsg,
yysymbol_kind_t yykind, YYSTYPE *yyvaluep)
{
YY_USE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YY_USE (yykind);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/* Lookahead token kind. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
/*----------.
| yyparse. |
`----------*/
int
yyparse (void)
{
yy_state_fast_t yystate = 0;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus = 0;
/* Refer to the stacks through separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* Their size. */
YYPTRDIFF_T yystacksize = YYINITDEPTH;
/* The state stack: array, bottom, top. */
yy_state_t yyssa[YYINITDEPTH];
yy_state_t *yyss = yyssa;
yy_state_t *yyssp = yyss;
/* The semantic value stack: array, bottom, top. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs = yyvsa;
YYSTYPE *yyvsp = yyvs;
int yyn;
/* The return value of yyparse. */
int yyresult;
/* Lookahead symbol kind. */
yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
YYDPRINTF ((stderr, "Starting parse\n"));
yychar = YYEMPTY; /* Cause a token to be read. */
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
/*--------------------------------------------------------------------.
| yysetstate -- set current state (the top of the stack) to yystate. |
`--------------------------------------------------------------------*/
yysetstate:
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
YY_IGNORE_USELESS_CAST_BEGIN
*yyssp = YY_CAST (yy_state_t, yystate);
YY_IGNORE_USELESS_CAST_END
YY_STACK_PRINT (yyss, yyssp);
if (yyss + yystacksize - 1 <= yyssp)
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
YYNOMEM;
#else
{
/* Get the current used size of the three stacks, in elements. */
YYPTRDIFF_T yysize = yyssp - yyss + 1;
# if defined yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
yy_state_t *yyss1 = yyss;
YYSTYPE *yyvs1 = yyvs;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. This used to be a
conditional around just the two extra args, but that might
be undefined if yyoverflow is a macro. */
yyoverflow (YY_("memory exhausted"),
&yyss1, yysize * YYSIZEOF (*yyssp),
&yyvs1, yysize * YYSIZEOF (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
# else /* defined YYSTACK_RELOCATE */
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
YYNOMEM;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yy_state_t *yyss1 = yyss;
union yyalloc *yyptr =
YY_CAST (union yyalloc *,
YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));
if (! yyptr)
YYNOMEM;
YYSTACK_RELOCATE (yyss_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
YY_IGNORE_USELESS_CAST_BEGIN
YYDPRINTF ((stderr, "Stack size increased to %ld\n",
YY_CAST (long, yystacksize)));
YY_IGNORE_USELESS_CAST_END
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
if (yystate == YYFINAL)
YYACCEPT;
goto yybackup;
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
lookahead token if we need one and don't already have one. */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yypact_value_is_default (yyn))
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* YYCHAR is either empty, or end-of-input, or a valid lookahead. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token\n"));
yychar = yylex ();
}
if (yychar <= YYEOF)
{
yychar = YYEOF;
yytoken = YYSYMBOL_YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else if (yychar == YYerror)
{
/* The scanner already issued an error message, process directly
to error recovery. But do not keep the error token as
lookahead, it is too special and may lead us to an endless
loop in error recovery. */
yychar = YYUNDEF;
yytoken = YYSYMBOL_YYerror;
goto yyerrlab1;
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
/* If the proper action on seeing token YYTOKEN is to reduce or to
detect an error, take that action. */
yyn += yytoken;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
yyn = yytable[yyn];
if (yyn <= 0)
{
if (yytable_value_is_error (yyn))
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the lookahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
yystate = yyn;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
/* Discard the shifted token. */
yychar = YYEMPTY;
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
'$$ = $1'.
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 8: /* spec: ZZOPERATOR name ZZALIAS ZZIDENTIFIER ZZPATTERN pattern implicit bufferforced */
#line 853 "SpecParser.y"
{ processedSpecifications++;
(*currenttranslation.opname) << (yyvsp[-6].text);
currenttranslation.alias = (yyvsp[-4].text);
// check for new operator
string op = string((yyvsp[-6].text));
string opWithPattern= op+" " +
currenttranslation.pattern->str();
if(currenttranslation.bufferForced ){
opWithPattern +="!!";
}
if(operatornames.find(op)==operatornames.end()){
operatornames.insert(op);
opnamesWithPattern.insert(opWithPattern);
printtranslation(); // print out the current translation
} else{
// operator already exists check for different pattern
if(opnamesWithPattern.find(opWithPattern)==
opnamesWithPattern.end()){
cerr << " Conflicting definition of operator "
<< op << endl;
cerr << " Line in spec file is " << yylineno << endl;
removeFiles();
exit(1);
}
}
reset(); // make clean
}
#line 1964 "SpecParser.tab.cpp"
break;
case 9: /* name: ZZIDENTIFIER */
#line 883 "SpecParser.y"
{ (yyval.text) = (yyvsp[0].text); }
#line 1970 "SpecParser.tab.cpp"
break;
case 10: /* name: ZZSYMBOL */
#line 885 "SpecParser.y"
{ (yyval.text) = (yyvsp[0].text); }
#line 1976 "SpecParser.tab.cpp"
break;
case 13: /* pattern: postfix */
#line 891 "SpecParser.y"
{
currenttranslation.isPostfix=true;
}
#line 1984 "SpecParser.tab.cpp"
break;
case 14: /* infix: '_' ZZINFIXOP '_' */
#line 897 "SpecParser.y"
{ currenttranslation.isSimple=true;
(*currenttranslation.token) << "ZZINFIXOP";
(*currenttranslation.pattern) << "_infixop_";
}
#line 1993 "SpecParser.tab.cpp"
break;
case 15: /* prefix: ZZOP '(' simpleargscomma ')' */
#line 904 "SpecParser.y"
{ currenttranslation.isSimple = true;
(*currenttranslation.token) << "ZZPREFIXOP";
(*currenttranslation.pattern) << "op(_";
for(int i=1;i<(yyvsp[-1].len);i++){
(*currenttranslation.pattern) << ",_";
}
(*currenttranslation.pattern) << ")";
}
#line 2006 "SpecParser.tab.cpp"
break;
case 16: /* prefix: ZZOP '(' ')' */
#line 913 "SpecParser.y"
{ currenttranslation.isSimple = true;
(*currenttranslation.token) << "ZZPREFIXOP";
(*currenttranslation.pattern) << "op(";
(*currenttranslation.pattern) << ")";
}
#line 2016 "SpecParser.tab.cpp"
break;
case 17: /* postfix: simpleargsblank ZZOP */
#line 922 "SpecParser.y"
{ currenttranslation.isSimple=true;
(*currenttranslation.token) << "ZZPOSTFIXOP"
<< (currenttranslation.arguments1->size());
for(int i=0;i<(yyvsp[-1].len);i++){
(*currenttranslation.pattern) << "_";
}
(*currenttranslation.pattern) << "op";
}
#line 2029 "SpecParser.tab.cpp"
break;
case 18: /* postfix: simpleargsblank ZZOP '[' arguments ']' */
#line 931 "SpecParser.y"
{ (*currenttranslation.token) << "ZZPOSTFIXOP"
<< (currenttranslation.arguments1->size());
for(int i=0;i<(yyvsp[-4].len);i++){
(*currenttranslation.pattern) << "_";
}
(*currenttranslation.pattern) << "op[";
int lists = 0;
int nextlist = (*currenttranslation.sublistlengths)[0];
int size = currenttranslation.arguments2->size();
(*currenttranslation.pattern) <<
(*currenttranslation.arguments2)[0];
for(int i=1;i< size;i++){
if(i==nextlist){
lists++;
nextlist=(*currenttranslation.sublistlengths)[lists];
(*currenttranslation.pattern ) << ";" << endl;
}else{
(*currenttranslation.pattern) << "," << endl;
}
(*currenttranslation.pattern)
<< (*currenttranslation.arguments2)[i];
}
(*currenttranslation.pattern) << "]";
}
#line 2058 "SpecParser.tab.cpp"
break;
case 19: /* simpleargscomma: '_' */
#line 959 "SpecParser.y"
{(yyval.len) = 1; }
#line 2064 "SpecParser.tab.cpp"
break;
case 20: /* simpleargscomma: simpleargscomma ',' '_' */
#line 961 "SpecParser.y"
{(yyval.len) = (yyvsp[-2].len) + 1;}
#line 2070 "SpecParser.tab.cpp"
break;
case 21: /* simpleargsblank: '_' */
#line 965 "SpecParser.y"
{ currenttranslation.arguments1->push_back("valueexpr");
(yyval.len) = 1;
}
#line 2078 "SpecParser.tab.cpp"
break;
case 22: /* simpleargsblank: simpleargsblank '_' */
#line 969 "SpecParser.y"
{ currenttranslation.arguments1->push_back("valueexpr");
(yyval.len) = (yyvsp[-1].len) + 1;
}
#line 2086 "SpecParser.tab.cpp"
break;
case 25: /* sublist: argscomma */
#line 979 "SpecParser.y"
{ currenttranslation.sublistlengths->push_back((yyvsp[0].len));
}
#line 2093 "SpecParser.tab.cpp"
break;
case 26: /* sublist: ZZLIST */
#line 982 "SpecParser.y"
{ currenttranslation.arguments2->push_back("list");
currenttranslation.isSimple = false;
currenttranslation.sublistlengths->push_back(1);
}
#line 2102 "SpecParser.tab.cpp"
break;
case 27: /* sublist: ZZFUNLIST */
#line 986 "SpecParser.y"
{
currenttranslation.arguments2->push_back("funlist");
currenttranslation.isSimple = false;
currenttranslation.sublistlengths->push_back(1);
}
#line 2112 "SpecParser.tab.cpp"
break;
case 28: /* argscomma: arg */
#line 994 "SpecParser.y"
{ (yyval.len) = 1; }
#line 2118 "SpecParser.tab.cpp"
break;
case 29: /* argscomma: argscomma ',' arg */
#line 996 "SpecParser.y"
{ (yyval.len) = (yyvsp[-2].len) + 1; }
#line 2124 "SpecParser.tab.cpp"
break;
case 30: /* arg: '_' */
#line 1000 "SpecParser.y"
{ currenttranslation.arguments2->push_back("valueexpr");
}
#line 2131 "SpecParser.tab.cpp"
break;
case 31: /* arg: ZZFUN */
#line 1003 "SpecParser.y"
{ currenttranslation.arguments2->push_back("fun");
currenttranslation.isSimple=false;
}
#line 2139 "SpecParser.tab.cpp"
break;
case 32: /* implicit: ZZIMPLICIT rest */
#line 1009 "SpecParser.y"
{ (*currenttranslation.pattern) << "implicit ";
int size = currenttranslation.implicitNames->size();
for(int i=0;i<size;i++){
(*currenttranslation.pattern)
<< (*currenttranslation.implicitNames)[i] << " ";
}
(*currenttranslation.pattern) << "types ";
size = currenttranslation.implicitTypes->size();
for(int i=0;i<size;i++){
(*currenttranslation.pattern)
<< (*currenttranslation.implicitTypes)[i] << " ";
}
}
#line 2157 "SpecParser.tab.cpp"
break;
case 36: /* bufferforced: ZZFORCEBUFFER */
#line 1030 "SpecParser.y"
{ currenttranslation.bufferForced=true;
}
#line 2164 "SpecParser.tab.cpp"
break;
case 37: /* bufferforced: %empty */
#line 1032 "SpecParser.y"
{ currenttranslation.bufferForced=false;
}
#line 2171 "SpecParser.tab.cpp"
break;
case 38: /* parameterlist: ZZIDENTIFIER */
#line 1037 "SpecParser.y"
{ currenttranslation.implicitNames->push_back(string((yyvsp[0].text)));
}
#line 2178 "SpecParser.tab.cpp"
break;
case 39: /* parameterlist: parameterlist ',' ZZIDENTIFIER */
#line 1040 "SpecParser.y"
{ currenttranslation.implicitNames->push_back(string((yyvsp[0].text)));
}
#line 2185 "SpecParser.tab.cpp"
break;
case 40: /* typelist: ZZIDENTIFIER */
#line 1044 "SpecParser.y"
{ currenttranslation.implicitTypes->push_back(string((yyvsp[0].text)));
}
#line 2192 "SpecParser.tab.cpp"
break;
case 41: /* typelist: typelist ',' ZZIDENTIFIER */
#line 1047 "SpecParser.y"
{ currenttranslation.implicitTypes->push_back(string((yyvsp[0].text)));
}
#line 2199 "SpecParser.tab.cpp"
break;
#line 2203 "SpecParser.tab.cpp"
default: break;
}
/* User semantic actions sometimes alter yychar, and that requires
that yytoken be updated with the new translation. We take the
approach of translating immediately before every use of yytoken.
One alternative is translating here after every semantic action,
but that translation would be missed if the semantic action invokes
YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an
incorrect destructor might then be invoked immediately. In the
case of YYERROR or YYBACKUP, subsequent parser actions might lead
to an incorrect destructor call or verbose syntax error message
before the lookahead is translated. */
YY_SYMBOL_PRINT ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
*++yyvsp = yyval;
/* Now 'shift' the result of the reduction. Determine what state
that goes to, based on the state we popped back to and the rule
number reduced by. */
{
const int yylhs = yyr1[yyn] - YYNTOKENS;
const int yyi = yypgoto[yylhs] + *yyssp;
yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
? yytable[yyi]
: yydefgoto[yylhs]);
}
goto yynewstate;
/*--------------------------------------.
| yyerrlab -- here on detecting error. |
`--------------------------------------*/
yyerrlab:
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = yychar == YYEMPTY ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar);
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
yyerror (YY_("syntax error"));
}
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse lookahead token after an
error, discard it. */
if (yychar <= YYEOF)
{
/* Return failure if at end of input. */
if (yychar == YYEOF)
YYABORT;
}
else
{
yydestruct ("Error: discarding",
yytoken, &yylval);
yychar = YYEMPTY;
}
}
/* Else will try to reuse lookahead token after shifting the error
token. */
goto yyerrlab1;
/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR. |
`---------------------------------------------------*/
yyerrorlab:
/* Pacify compilers when the user code never invokes YYERROR and the
label yyerrorlab therefore never appears in user code. */
if (0)
YYERROR;
++yynerrs;
/* Do not reclaim the symbols of the rule whose action triggered
this YYERROR. */
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
yystate = *yyssp;
goto yyerrlab1;
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3; /* Each real token shifted decrements this. */
/* Pop stack until we find a state that shifts the error token. */
for (;;)
{
yyn = yypact[yystate];
if (!yypact_value_is_default (yyn))
{
yyn += YYSYMBOL_YYerror;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
/* Pop the current state because it cannot handle the error token. */
if (yyssp == yyss)
YYABORT;
yydestruct ("Error: popping",
YY_ACCESSING_SYMBOL (yystate), yyvsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", YY_ACCESSING_SYMBOL (yyn), yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturnlab;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturnlab;
/*-----------------------------------------------------------.
| yyexhaustedlab -- YYNOMEM (memory exhaustion) comes here. |
`-----------------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
goto yyreturnlab;
/*----------------------------------------------------------.
| yyreturnlab -- parsing is finished, clean up and return. |
`----------------------------------------------------------*/
yyreturnlab:
if (yychar != YYEMPTY)
{
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = YYTRANSLATE (yychar);
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval);
}
/* Do not reclaim the symbols of the rule whose action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
yydestruct ("Cleanup: popping",
YY_ACCESSING_SYMBOL (+*yyssp), yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
return yyresult;
}
#line 1050 "SpecParser.y"
int main(int argc, char** argv) {
FILE* ifile;
if(argc > 1){
ifile = fopen(argv[1], "r");
if (ifile == NULL) {
fprintf(stderr,"ERROR: cannot open file %s\n",argv[1]);
fprintf(stderr,"%s",argv[1]);
fprintf(stderr,"\n");
return -1;
}
yyin = ifile;
}
if(!init()){
cerr << "Error in initialization " << endl;
removeFiles();
return -1;
}
if(yyparse()!=0){
cerr << " Error in parsing specification" << endl;
removeFiles();
return -1;
}
printStatistics();
if(!finalize()){
cerr << "Error in finalization " << endl;
removeFiles();
return -1;
}
return 0;
}
Reference in New Issue View Git Blame Copy Permalink