aboutsummaryrefslogtreecommitdiff
path: root/utils/TableGen/FileParser.cpp.cvs
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2007-11-22 20:49:04 +0000
committerChris Lattner <sabre@nondot.org>2007-11-22 20:49:04 +0000
commitf460165a4c1bf4bc762f9b3f12b9ed284b89cc99 (patch)
tree682aa3de3d166b50c3025180826f14903bbd5e1e /utils/TableGen/FileParser.cpp.cvs
parented4a2f168873527e1737deaa7a0c6c045a2cff7d (diff)
Rewrite the tblgen parser in a recursive descent style, eliminating the bison parser.
This makes the parser much easier to understand, eliminates a ton of global variables, and gives tblgen nice caret diagnostics. It is also faster, but tblgen probably doesn't care about performance. There are a couple of FIXMEs which I will take care of next. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@44274 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'utils/TableGen/FileParser.cpp.cvs')
-rw-r--r--utils/TableGen/FileParser.cpp.cvs2106
1 files changed, 0 insertions, 2106 deletions
diff --git a/utils/TableGen/FileParser.cpp.cvs b/utils/TableGen/FileParser.cpp.cvs
deleted file mode 100644
index a49846ffa0..0000000000
--- a/utils/TableGen/FileParser.cpp.cvs
+++ /dev/null
@@ -1,2106 +0,0 @@
-
-/* A Bison parser, made from /Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y
- by GNU Bison version 1.28 */
-
-#define YYBISON 1 /* Identify Bison output. */
-
-#define yyparse Fileparse
-#define yylex Filelex
-#define yyerror Fileerror
-#define yylval Filelval
-#define yychar Filechar
-#define yydebug Filedebug
-#define yynerrs Filenerrs
-#define INT 257
-#define BIT 258
-#define STRING 259
-#define BITS 260
-#define LIST 261
-#define CODE 262
-#define DAG 263
-#define CLASS 264
-#define DEF 265
-#define MULTICLASS 266
-#define DEFM 267
-#define FIELD 268
-#define LET 269
-#define IN 270
-#define CONCATTOK 271
-#define SHLTOK 272
-#define SRATOK 273
-#define SRLTOK 274
-#define STRCONCATTOK 275
-#define INTVAL 276
-#define ID 277
-#define VARNAME 278
-#define STRVAL 279
-#define CODEFRAGMENT 280
-
-#line 14 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-
-#include "Record.h"
-#include "llvm/ADT/StringExtras.h"
-#include "llvm/Support/Streams.h"
-#include <algorithm>
-#include <cstdio>
-#define YYERROR_VERBOSE 1
-
-int yyerror(const char *ErrorMsg);
-int yylex();
-
-namespace llvm {
- struct MultiClass {
- Record Rec; // Placeholder for template args and Name.
- std::vector<Record*> DefPrototypes;
-
- MultiClass(const std::string &Name) : Rec(Name) {}
- };
-
-
-static std::map<std::string, MultiClass*> MultiClasses;
-
-extern int Filelineno;
-static MultiClass *CurMultiClass = 0; // Set while parsing a multiclass.
-static std::string *CurDefmPrefix = 0; // Set while parsing defm.
-static Record *CurRec = 0;
-static bool ParsingTemplateArgs = false;
-
-typedef std::pair<Record*, std::vector<Init*>*> SubClassRefTy;
-
-struct LetRecord {
- std::string Name;
- std::vector<unsigned> Bits;
- Init *Value;
- bool HasBits;
- LetRecord(const std::string &N, std::vector<unsigned> *B, Init *V)
- : Name(N), Value(V), HasBits(B != 0) {
- if (HasBits) Bits = *B;
- }
-};
-
-static std::vector<std::vector<LetRecord> > LetStack;
-
-
-extern std::ostream &err();
-
-/// getActiveRec - If inside a def/class definition, return the def/class.
-/// Otherwise, if within a multidef, return it.
-static Record *getActiveRec() {
- return CurRec ? CurRec : &CurMultiClass->Rec;
-}
-
-static void addValue(const RecordVal &RV) {
- Record *TheRec = getActiveRec();
-
- if (RecordVal *ERV = TheRec->getValue(RV.getName())) {
- // The value already exists in the class, treat this as a set...
- if (ERV->setValue(RV.getValue())) {
- err() << "New definition of '" << RV.getName() << "' of type '"
- << *RV.getType() << "' is incompatible with previous "
- << "definition of type '" << *ERV->getType() << "'!\n";
- exit(1);
- }
- } else {
- TheRec->addValue(RV);
- }
-}
-
-static void addSuperClass(Record *SC) {
- if (CurRec->isSubClassOf(SC)) {
- err() << "Already subclass of '" << SC->getName() << "'!\n";
- exit(1);
- }
- CurRec->addSuperClass(SC);
-}
-
-static void setValue(const std::string &ValName,
- std::vector<unsigned> *BitList, Init *V) {
- if (!V) return;
-
- Record *TheRec = getActiveRec();
- RecordVal *RV = TheRec->getValue(ValName);
- if (RV == 0) {
- err() << "Value '" << ValName << "' unknown!\n";
- exit(1);
- }
-
- // Do not allow assignments like 'X = X'. This will just cause infinite loops
- // in the resolution machinery.
- if (!BitList)
- if (VarInit *VI = dynamic_cast<VarInit*>(V))
- if (VI->getName() == ValName)
- return;
-
- // If we are assigning to a subset of the bits in the value... then we must be
- // assigning to a field of BitsRecTy, which must have a BitsInit
- // initializer...
- //
- if (BitList) {
- BitsInit *CurVal = dynamic_cast<BitsInit*>(RV->getValue());
- if (CurVal == 0) {
- err() << "Value '" << ValName << "' is not a bits type!\n";
- exit(1);
- }
-
- // Convert the incoming value to a bits type of the appropriate size...
- Init *BI = V->convertInitializerTo(new BitsRecTy(BitList->size()));
- if (BI == 0) {
- V->convertInitializerTo(new BitsRecTy(BitList->size()));
- err() << "Initializer '" << *V << "' not compatible with bit range!\n";
- exit(1);
- }
-
- // We should have a BitsInit type now...
- assert(dynamic_cast<BitsInit*>(BI) != 0 || (cerr << *BI).stream() == 0);
- BitsInit *BInit = (BitsInit*)BI;
-
- BitsInit *NewVal = new BitsInit(CurVal->getNumBits());
-
- // Loop over bits, assigning values as appropriate...
- for (unsigned i = 0, e = BitList->size(); i != e; ++i) {
- unsigned Bit = (*BitList)[i];
- if (NewVal->getBit(Bit)) {
- err() << "Cannot set bit #" << Bit << " of value '" << ValName
- << "' more than once!\n";
- exit(1);
- }
- NewVal->setBit(Bit, BInit->getBit(i));
- }
-
- for (unsigned i = 0, e = CurVal->getNumBits(); i != e; ++i)
- if (NewVal->getBit(i) == 0)
- NewVal->setBit(i, CurVal->getBit(i));
-
- V = NewVal;
- }
-
- if (RV->setValue(V)) {
- err() << "Value '" << ValName << "' of type '" << *RV->getType()
- << "' is incompatible with initializer '" << *V << "'!\n";
- exit(1);
- }
-}
-
-// addSubClass - Add SC as a subclass to CurRec, resolving TemplateArgs as SC's
-// template arguments.
-static void addSubClass(Record *SC, const std::vector<Init*> &TemplateArgs) {
- // Add all of the values in the subclass into the current class...
- const std::vector<RecordVal> &Vals = SC->getValues();
- for (unsigned i = 0, e = Vals.size(); i != e; ++i)
- addValue(Vals[i]);
-
- const std::vector<std::string> &TArgs = SC->getTemplateArgs();
-
- // Ensure that an appropriate number of template arguments are specified...
- if (TArgs.size() < TemplateArgs.size()) {
- err() << "ERROR: More template args specified than expected!\n";
- exit(1);
- }
-
- // Loop over all of the template arguments, setting them to the specified
- // value or leaving them as the default if necessary.
- for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
- if (i < TemplateArgs.size()) { // A value is specified for this temp-arg?
- // Set it now.
- setValue(TArgs[i], 0, TemplateArgs[i]);
-
- // Resolve it next.
- CurRec->resolveReferencesTo(CurRec->getValue(TArgs[i]));
-
-
- // Now remove it.
- CurRec->removeValue(TArgs[i]);
-
- } else if (!CurRec->getValue(TArgs[i])->getValue()->isComplete()) {
- err() << "ERROR: Value not specified for template argument #"
- << i << " (" << TArgs[i] << ") of subclass '" << SC->getName()
- << "'!\n";
- exit(1);
- }
- }
-
- // Since everything went well, we can now set the "superclass" list for the
- // current record.
- const std::vector<Record*> &SCs = SC->getSuperClasses();
- for (unsigned i = 0, e = SCs.size(); i != e; ++i)
- addSuperClass(SCs[i]);
- addSuperClass(SC);
-}
-
-} // End llvm namespace
-
-using namespace llvm;
-
-
-#line 210 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-typedef union {
- std::string* StrVal;
- int IntVal;
- llvm::RecTy* Ty;
- llvm::Init* Initializer;
- std::vector<llvm::Init*>* FieldList;
- std::vector<unsigned>* BitList;
- llvm::Record* Rec;
- std::vector<llvm::Record*>* RecList;
- SubClassRefTy* SubClassRef;
- std::vector<SubClassRefTy>* SubClassList;
- std::vector<std::pair<llvm::Init*, std::string> >* DagValueList;
-} YYSTYPE;
-#include <stdio.h>
-
-#ifndef __cplusplus
-#ifndef __STDC__
-#define const
-#endif
-#endif
-
-
-
-#define YYFINAL 194
-#define YYFLAG -32768
-#define YYNTBASE 42
-
-#define YYTRANSLATE(x) ((unsigned)(x) <= 280 ? yytranslate[x] : 91)
-
-static const char yytranslate[] = { 0,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 36,
- 37, 2, 2, 38, 40, 35, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 39, 41, 27,
- 29, 28, 30, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 33, 2, 34, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 31, 2, 32, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 1, 3, 4, 5, 6,
- 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
- 17, 18, 19, 20, 21, 22, 23, 24, 25, 26
-};
-
-#if YYDEBUG != 0
-static const short yyprhs[] = { 0,
- 0, 2, 4, 6, 11, 13, 18, 20, 22, 24,
- 25, 27, 28, 31, 33, 35, 37, 39, 41, 43,
- 47, 52, 57, 61, 65, 70, 75, 82, 89, 96,
- 103, 110, 111, 114, 117, 122, 123, 125, 127, 131,
- 134, 138, 144, 149, 151, 152, 156, 157, 159, 161,
- 165, 170, 173, 180, 181, 184, 186, 190, 192, 197,
- 199, 203, 204, 207, 209, 213, 217, 218, 220, 222,
- 223, 225, 227, 229, 230, 234, 235, 236, 243, 247,
- 249, 251, 254, 256, 257, 258, 267, 268, 275, 277,
- 279, 281, 283, 288, 290, 294, 295, 300, 305, 308,
- 310, 313
-};
-
-static const short yyrhs[] = { 23,
- 0, 5, 0, 4, 0, 6, 27, 22, 28, 0,
- 3, 0, 7, 27, 43, 28, 0, 8, 0, 9,
- 0, 42, 0, 0, 14, 0, 0, 29, 47, 0,
- 23, 0, 46, 0, 22, 0, 25, 0, 26, 0,
- 30, 0, 31, 54, 32, 0, 23, 27, 55, 28,
- 0, 47, 31, 52, 32, 0, 33, 54, 34, 0,
- 47, 35, 23, 0, 36, 46, 50, 37, 0, 47,
- 33, 52, 34, 0, 17, 36, 47, 38, 47, 37,
- 0, 18, 36, 47, 38, 47, 37, 0, 19, 36,
- 47, 38, 47, 37, 0, 20, 36, 47, 38, 47,
- 37, 0, 21, 36, 47, 38, 47, 37, 0, 0,
- 39, 24, 0, 47, 48, 0, 49, 38, 47, 48,
- 0, 0, 49, 0, 22, 0, 22, 40, 22, 0,
- 22, 22, 0, 51, 38, 22, 0, 51, 38, 22,
- 40, 22, 0, 51, 38, 22, 22, 0, 51, 0,
- 0, 31, 52, 32, 0, 0, 55, 0, 47, 0,
- 55, 38, 47, 0, 44, 43, 23, 45, 0, 56,
- 41, 0, 15, 23, 53, 29, 47, 41, 0, 0,
- 58, 57, 0, 41, 0, 31, 58, 32, 0, 42,
- 0, 42, 27, 55, 28, 0, 60, 0, 61, 38,
- 60, 0, 0, 39, 61, 0, 56, 0, 63, 38,
- 56, 0, 27, 63, 28, 0, 0, 64, 0, 23,
- 0, 0, 66, 0, 67, 0, 67, 0, 0, 62,
- 71, 59, 0, 0, 0, 10, 68, 73, 65, 74,
- 70, 0, 11, 69, 70, 0, 75, 0, 76, 0,
- 77, 76, 0, 23, 0, 0, 0, 12, 78, 80,
- 65, 81, 31, 77, 32, 0, 0, 13, 23, 83,
- 39, 60, 41, 0, 72, 0, 75, 0, 79, 0,
- 82, 0, 23, 53, 29, 47, 0, 85, 0, 86,
- 38, 85, 0, 0, 15, 88, 86, 16, 0, 87,
- 31, 89, 32, 0, 87, 84, 0, 84, 0, 89,
- 84, 0, 89, 0
-};
-
-#endif
-
-#if YYDEBUG != 0
-static const short yyrline[] = { 0,
- 246, 268, 270, 272, 274, 276, 278, 280, 282, 286,
- 286, 288, 288, 290, 313, 315, 317, 320, 323, 325,
- 338, 366, 373, 376, 383, 386, 394, 396, 398, 400,
- 402, 406, 409, 413, 418, 424, 427, 430, 433, 446,
- 460, 462, 475, 491, 493, 493, 497, 499, 503, 506,
- 510, 527, 529, 535, 535, 536, 536, 538, 540, 544,
- 549, 554, 557, 561, 564, 569, 570, 570, 572, 572,
- 574, 581, 599, 624, 638, 643, 645, 647, 651, 661,
- 675, 678, 682, 693, 695, 697, 702, 702, 776, 776,
- 777, 777, 779, 784, 784, 787, 787, 790, 793, 797,
- 797, 799
-};
-#endif
-
-
-#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
-
-static const char * const yytname[] = { "$","error","$undefined.","INT","BIT",
-"STRING","BITS","LIST","CODE","DAG","CLASS","DEF","MULTICLASS","DEFM","FIELD",
-"LET","IN","CONCATTOK","SHLTOK","SRATOK","SRLTOK","STRCONCATTOK","INTVAL","ID",
-"VARNAME","STRVAL","CODEFRAGMENT","'<'","'>'","'='","'?'","'{'","'}'","'['",
-"']'","'.'","'('","')'","','","':'","'-'","';'","ClassID","Type","OptPrefix",
-"OptValue","IDValue","Value","OptVarName","DagArgListNE","DagArgList","RBitList",
-"BitList","OptBitList","ValueList","ValueListNE","Declaration","BodyItem","BodyList",
-"Body","SubClassRef","ClassListNE","ClassList","DeclListNE","TemplateArgList",
-"OptTemplateArgList","OptID","ObjectName","ClassName","DefName","ObjectBody",
-"@1","ClassInst","@2","@3","DefInst","MultiClassDef","MultiClassBody","MultiClassName",
-"MultiClassInst","@4","@5","DefMInst","@6","Object","LETItem","LETList","LETCommand",
-"@7","ObjectList","File", NULL
-};
-#endif
-
-static const short yyr1[] = { 0,
- 42, 43, 43, 43, 43, 43, 43, 43, 43, 44,
- 44, 45, 45, 46, 47, 47, 47, 47, 47, 47,
- 47, 47, 47, 47, 47, 47, 47, 47, 47, 47,
- 47, 48, 48, 49, 49, 50, 50, 51, 51, 51,
- 51, 51, 51, 52, 53, 53, 54, 54, 55, 55,
- 56, 57, 57, 58, 58, 59, 59, 60, 60, 61,
- 61, 62, 62, 63, 63, 64, 65, 65, 66, 66,
- 67, 68, 69, 71, 70, 73, 74, 72, 75, 76,
- 77, 77, 78, 80, 81, 79, 83, 82, 84, 84,
- 84, 84, 85, 86, 86, 88, 87, 84, 84, 89,
- 89, 90
-};
-
-static const short yyr2[] = { 0,
- 1, 1, 1, 4, 1, 4, 1, 1, 1, 0,
- 1, 0, 2, 1, 1, 1, 1, 1, 1, 3,
- 4, 4, 3, 3, 4, 4, 6, 6, 6, 6,
- 6, 0, 2, 2, 4, 0, 1, 1, 3, 2,
- 3, 5, 4, 1, 0, 3, 0, 1, 1, 3,
- 4, 2, 6, 0, 2, 1, 3, 1, 4, 1,
- 3, 0, 2, 1, 3, 3, 0, 1, 1, 0,
- 1, 1, 1, 0, 3, 0, 0, 6, 3, 1,
- 1, 2, 1, 0, 0, 8, 0, 6, 1, 1,
- 1, 1, 4, 1, 3, 0, 4, 4, 2, 1,
- 2, 1
-};
-
-static const short yydefact[] = { 0,
- 70, 70, 0, 0, 96, 89, 90, 91, 92, 100,
- 0, 102, 69, 71, 72, 76, 73, 62, 83, 84,
- 87, 0, 0, 99, 101, 67, 0, 74, 79, 67,
- 0, 45, 94, 0, 0, 10, 68, 77, 1, 58,
- 60, 63, 0, 85, 0, 0, 0, 97, 0, 98,
- 11, 0, 64, 0, 62, 0, 0, 54, 56, 75,
- 0, 0, 38, 44, 0, 0, 95, 5, 3, 2,
- 0, 0, 7, 8, 9, 0, 66, 10, 78, 0,
- 0, 0, 0, 0, 16, 14, 17, 18, 19, 47,
- 47, 0, 15, 49, 0, 61, 10, 0, 88, 40,
- 0, 0, 46, 93, 0, 0, 12, 65, 0, 0,
- 0, 0, 0, 0, 0, 48, 0, 14, 36, 0,
- 0, 0, 59, 0, 0, 57, 0, 55, 80, 81,
- 0, 39, 41, 0, 0, 0, 51, 0, 0, 0,
- 0, 0, 0, 20, 23, 32, 37, 0, 0, 0,
- 24, 50, 45, 52, 86, 82, 43, 0, 4, 6,
- 13, 0, 0, 0, 0, 0, 21, 0, 34, 0,
- 25, 22, 26, 0, 42, 0, 0, 0, 0, 0,
- 33, 32, 0, 27, 28, 29, 30, 31, 35, 0,
- 53, 0, 0, 0
-};
-
-static const short yydefgoto[] = { 40,
- 76, 52, 137, 93, 94, 169, 147, 148, 64, 65,
- 47, 115, 116, 53, 128, 97, 60, 41, 42, 28,
- 54, 37, 38, 14, 15, 16, 18, 29, 43, 6,
- 26, 55, 7, 130, 131, 20, 8, 30, 61, 9,
- 31, 10, 33, 34, 11, 22, 12, 192
-};
-
-static const short yypact[] = { 147,
- -17, -17, 8, 12,-32768,-32768,-32768,-32768,-32768,-32768,
- 3, 147,-32768,-32768,-32768,-32768,-32768, -13,-32768,-32768,
--32768, 17, 147,-32768,-32768, 21, 58,-32768,-32768, 21,
- 45, 55,-32768, -5, -3, 77,-32768,-32768,-32768, 68,
--32768, 64, -4,-32768, 58, 84, 81,-32768, 17,-32768,
--32768, 16,-32768, 13, -13, 43, 58,-32768,-32768,-32768,
- 88, 74, 10, 83, 93, 43,-32768,-32768,-32768,-32768,
- 100, 104,-32768,-32768,-32768, 110,-32768, 77,-32768, 117,
- 125, 127, 128, 129,-32768, 139,-32768,-32768,-32768, 43,
- 43, 132,-32768, 59, 14,-32768, 40, 156,-32768,-32768,
- 146, 148,-32768, 59, 149, 16, 140,-32768, 43, 43,
- 43, 43, 43, 43, 141, 134, 142,-32768, 43, 84,
- 84, 151,-32768, 43, 152,-32768, 136,-32768,-32768,-32768,
- 6,-32768, 35, 150, 153, 43,-32768, 70, 76, 85,
- 91, 97, 39,-32768,-32768, 54, 144, 143, 154, 145,
--32768, 59, 55,-32768,-32768,-32768,-32768, 161,-32768,-32768,
- 59, 43, 43, 43, 43, 43,-32768, 160,-32768, 43,
--32768,-32768,-32768, 158,-32768, 103, 106, 111, 114, 119,
--32768, 54, 43,-32768,-32768,-32768,-32768,-32768,-32768, 47,
--32768, 185, 188,-32768
-};
-
-static const short yypgoto[] = { -50,
- 86,-32768,-32768, 98, -66, 7,-32768,-32768,-32768, -8,
- 38, 102, -55, -48,-32768,-32768,-32768, 26,-32768,-32768,
--32768,-32768, 164,-32768, 193,-32768,-32768, 155,-32768,-32768,
--32768,-32768, -95, 65,-32768,-32768,-32768,-32768,-32768,-32768,
--32768, -7, 157,-32768,-32768,-32768, 174,-32768
-};
-
-
-#define YYLAST 210
-
-
-static const short yytable[] = { 104,
- 95, 75, 129, 24, 25, 13, 1, 2, 3, 4,
- 48, 5, 1, 2, 3, 4, 2, 5, 68, 69,
- 70, 71, 72, 73, 74, 27, 58, 25, 50, 108,
- 19, 100, 49, 23, 21, 129, 59, 155, 39, 32,
- 77, 123, 138, 139, 140, 141, 142, 36, 127, 101,
- 78, 124, 146, 51, 125, 75, 157, 152, 143, 80,
- 81, 82, 83, 84, 85, 86, 167, 87, 88, 161,
- 62, 126, 89, 90, 158, 91, 124, 120, 92, 121,
- 39, 122, 96, 45, 120, 46, 121, 191, 122, 120,
- 51, 121, 168, 122, 56, 176, 177, 178, 179, 180,
- 120, 57, 121, 182, 122, 63, 120, 162, 121, 66,
- 122, 149, 150, 163, 99, 120, 190, 121, 98, 122,
- 102, 120, 164, 121, 103, 122, 105, 120, 165, 121,
- 106, 122, 107, 120, 166, 121, 120, 122, 121, 184,
- 122, 120, 185, 121, 120, 122, 121, 186, 122, 120,
- 187, 121, 109, 122, 118, 188, 1, 2, 3, 4,
- 110, 5, 111, 112, 113, 114, 2, 132, 136, 133,
- 134, 124, 144, 151, 153, 145, 154, 159, 173, 171,
- 160, 170, 175, 181, 193, 172, 183, 194, 189, 119,
- 174, 135, 117, 44, 17, 156, 35, 0, 0, 0,
- 0, 0, 0, 0, 0, 67, 0, 0, 0, 79
-};
-
-static const short yycheck[] = { 66,
- 56, 52, 98, 11, 12, 23, 10, 11, 12, 13,
- 16, 15, 10, 11, 12, 13, 11, 15, 3, 4,
- 5, 6, 7, 8, 9, 39, 31, 35, 32, 78,
- 23, 22, 38, 31, 23, 131, 41, 32, 23, 23,
- 28, 28, 109, 110, 111, 112, 113, 27, 97, 40,
- 38, 38, 119, 14, 15, 106, 22, 124, 114, 17,
- 18, 19, 20, 21, 22, 23, 28, 25, 26, 136,
- 45, 32, 30, 31, 40, 33, 38, 31, 36, 33,
- 23, 35, 57, 39, 31, 31, 33, 41, 35, 31,
- 14, 33, 39, 35, 27, 162, 163, 164, 165, 166,
- 31, 38, 33, 170, 35, 22, 31, 38, 33, 29,
- 35, 120, 121, 38, 41, 31, 183, 33, 31, 35,
- 38, 31, 38, 33, 32, 35, 27, 31, 38, 33,
- 27, 35, 23, 31, 38, 33, 31, 35, 33, 37,
- 35, 31, 37, 33, 31, 35, 33, 37, 35, 31,
- 37, 33, 36, 35, 23, 37, 10, 11, 12, 13,
- 36, 15, 36, 36, 36, 27, 11, 22, 29, 22,
- 22, 38, 32, 23, 23, 34, 41, 28, 34, 37,
- 28, 38, 22, 24, 0, 32, 29, 0, 182, 92,
- 153, 106, 91, 30, 2, 131, 23, -1, -1, -1,
- -1, -1, -1, -1, -1, 49, -1, -1, -1, 55
-};
-/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
-#line 3 "/usr/share/bison.simple"
-/* This file comes from bison-1.28. */
-
-/* Skeleton output parser for bison,
- Copyright (C) 1984, 1989, 1990 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 2, 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, write to the Free Software
- Foundation, Inc., 59 Temple Place - Suite 330,
- Boston, MA 02111-1307, USA. */
-
-/* As a special exception, when this file is copied by Bison into a
- Bison output file, you may use that output file without restriction.
- This special exception was added by the Free Software Foundation
- in version 1.24 of Bison. */
-
-/* This is the parser code that is written into each bison parser
- when the %semantic_parser declaration is not specified in the grammar.
- It was written by Richard Stallman by simplifying the hairy parser
- used when %semantic_parser is specified. */
-
-#ifndef YYSTACK_USE_ALLOCA
-#ifdef alloca
-#define YYSTACK_USE_ALLOCA
-#else /* alloca not defined */
-#ifdef __GNUC__
-#define YYSTACK_USE_ALLOCA
-#define alloca __builtin_alloca
-#else /* not GNU C. */
-#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
-#define YYSTACK_USE_ALLOCA
-#include <alloca.h>
-#else /* not sparc */
-/* We think this test detects Watcom and Microsoft C. */
-/* This used to test MSDOS, but that is a bad idea
- since that symbol is in the user namespace. */
-#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
-#if 0 /* No need for malloc.h, which pollutes the namespace;
- instead, just don't use alloca. */
-#include <malloc.h>
-#endif
-#else /* not MSDOS, or __TURBOC__ */
-#if defined(_AIX)
-/* I don't know what this was needed for, but it pollutes the namespace.
- So I turned it off. rms, 2 May 1997. */
-/* #include <malloc.h> */
- #pragma alloca
-#define YYSTACK_USE_ALLOCA
-#else /* not MSDOS, or __TURBOC__, or _AIX */
-#if 0
-#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
- and on HPUX 10. Eventually we can turn this on. */
-#define YYSTACK_USE_ALLOCA
-#define alloca __builtin_alloca
-#endif /* __hpux */
-#endif
-#endif /* not _AIX */
-#endif /* not MSDOS, or __TURBOC__ */
-#endif /* not sparc */
-#endif /* not GNU C */
-#endif /* alloca not defined */
-#endif /* YYSTACK_USE_ALLOCA not defined */
-
-#ifdef YYSTACK_USE_ALLOCA
-#define YYSTACK_ALLOC alloca
-#else
-#define YYSTACK_ALLOC malloc
-#endif
-
-/* Note: there must be only one dollar sign in this file.
- It is replaced by the list of actions, each action
- as one case of the switch. */
-
-#define yyerrok (yyerrstatus = 0)
-#define yyclearin (yychar = YYEMPTY)
-#define YYEMPTY -2
-#define YYEOF 0
-#define YYACCEPT goto yyacceptlab
-#define YYABORT goto yyabortlab
-#define YYERROR goto yyerrlab1
-/* Like YYERROR except do call yyerror.
- This remains here temporarily to ease the
- transition to the new meaning of YYERROR, for GCC.
- Once GCC version 2 has supplanted version 1, this can go. */
-#define YYFAIL goto yyerrlab
-#define YYRECOVERING() (!!yyerrstatus)
-#define YYBACKUP(token, value) \
-do \
- if (yychar == YYEMPTY && yylen == 1) \
- { yychar = (token), yylval = (value); \
- yychar1 = YYTRANSLATE (yychar); \
- YYPOPSTACK; \
- goto yybackup; \
- } \
- else \
- { yyerror ("syntax error: cannot back up"); YYERROR; } \
-while (0)
-
-#define YYTERROR 1
-#define YYERRCODE 256
-
-#ifndef YYPURE
-#define YYLEX yylex()
-#endif
-
-#ifdef YYPURE
-#ifdef YYLSP_NEEDED
-#ifdef YYLEX_PARAM
-#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
-#else
-#define YYLEX yylex(&yylval, &yylloc)
-#endif
-#else /* not YYLSP_NEEDED */
-#ifdef YYLEX_PARAM
-#define YYLEX yylex(&yylval, YYLEX_PARAM)
-#else
-#define YYLEX yylex(&yylval)
-#endif
-#endif /* not YYLSP_NEEDED */
-#endif
-
-/* If nonreentrant, generate the variables here */
-
-#ifndef YYPURE
-
-int yychar; /* the lookahead symbol */
-YYSTYPE yylval; /* the semantic value of the */
- /* lookahead symbol */
-
-#ifdef YYLSP_NEEDED
-YYLTYPE yylloc; /* location data for the lookahead */
- /* symbol */
-#endif
-
-int yynerrs; /* number of parse errors so far */
-#endif /* not YYPURE */
-
-#if YYDEBUG != 0
-int yydebug; /* nonzero means print parse trace */
-/* Since this is uninitialized, it does not stop multiple parsers
- from coexisting. */
-#endif
-
-/* YYINITDEPTH indicates the initial size of the parser's stacks */
-
-#ifndef YYINITDEPTH
-#define YYINITDEPTH 200
-#endif
-
-/* YYMAXDEPTH is the maximum size the stacks can grow to
- (effective only if the built-in stack extension method is used). */
-
-#if YYMAXDEPTH == 0
-#undef YYMAXDEPTH
-#endif
-
-#ifndef YYMAXDEPTH
-#define YYMAXDEPTH 10000
-#endif
-
-/* Define __yy_memcpy. Note that the size argument
- should be passed with type unsigned int, because that is what the non-GCC
- definitions require. With GCC, __builtin_memcpy takes an arg
- of type size_t, but it can handle unsigned int. */
-
-#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
-#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
-#else /* not GNU C or C++ */
-#ifndef __cplusplus
-
-/* This is the most reliable way to avoid incompatibilities
- in available built-in functions on various systems. */
-static void
-__yy_memcpy (to, from, count)
- char *to;
- char *from;
- unsigned int count;
-{
- register char *f = from;
- register char *t = to;
- register int i = count;
-
- while (i-- > 0)
- *t++ = *f++;
-}
-
-#else /* __cplusplus */
-
-/* This is the most reliable way to avoid incompatibilities
- in available built-in functions on various systems. */
-static void
-__yy_memcpy (char *to, char *from, unsigned int count)
-{
- register char *t = to;
- register char *f = from;
- register int i = count;
-
- while (i-- > 0)
- *t++ = *f++;
-}
-
-#endif
-#endif
-
-#line 217 "/usr/share/bison.simple"
-
-/* The user can define YYPARSE_PARAM as the name of an argument to be passed
- into yyparse. The argument should have type void *.
- It should actually point to an object.
- Grammar actions can access the variable by casting it
- to the proper pointer type. */
-
-#ifdef YYPARSE_PARAM
-#ifdef __cplusplus
-#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
-#define YYPARSE_PARAM_DECL
-#else /* not __cplusplus */
-#define YYPARSE_PARAM_ARG YYPARSE_PARAM
-#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
-#endif /* not __cplusplus */
-#else /* not YYPARSE_PARAM */
-#define YYPARSE_PARAM_ARG
-#define YYPARSE_PARAM_DECL
-#endif /* not YYPARSE_PARAM */
-
-/* Prevent warning if -Wstrict-prototypes. */
-#ifdef __GNUC__
-#ifdef YYPARSE_PARAM
-int yyparse (void *);
-#else
-int yyparse (void);
-#endif
-#endif
-
-int
-yyparse(YYPARSE_PARAM_ARG)
- YYPARSE_PARAM_DECL
-{
- register int yystate;
- register int yyn;
- register short *yyssp;
- register YYSTYPE *yyvsp;
- int yyerrstatus; /* number of tokens to shift before error messages enabled */
- int yychar1 = 0; /* lookahead token as an internal (translated) token number */
-
- short yyssa[YYINITDEPTH]; /* the state stack */
- YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
-
- short *yyss = yyssa; /* refer to the stacks thru separate pointers */
- YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
-
-#ifdef YYLSP_NEEDED
- YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
- YYLTYPE *yyls = yylsa;
- YYLTYPE *yylsp;
-
-#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
-#else
-#define YYPOPSTACK (yyvsp--, yyssp--)
-#endif
-
- int yystacksize = YYINITDEPTH;
- int yyfree_stacks = 0;
-
-#ifdef YYPURE
- int yychar;
- YYSTYPE yylval;
- int yynerrs;
-#ifdef YYLSP_NEEDED
- YYLTYPE yylloc;
-#endif
-#endif
-
- YYSTYPE yyval; /* the variable used to return */
- /* semantic values from the action */
- /* routines */
-
- int yylen;
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Starting parse\n");
-#endif
-
- yystate = 0;
- yyerrstatus = 0;
- yynerrs = 0;
- yychar = YYEMPTY; /* Cause a token to be read. */
-
- /* Initialize stack pointers.
- Waste one element of value and location stack
- so that they stay on the same level as the state stack.
- The wasted elements are never initialized. */
-
- yyssp = yyss - 1;
- yyvsp = yyvs;
-#ifdef YYLSP_NEEDED
- yylsp = yyls;
-#endif
-
-/* Push a new state, which is found in yystate . */
-/* In all cases, when you get here, the value and location stacks
- have just been pushed. so pushing a state here evens the stacks. */
-yynewstate:
-
- *++yyssp = yystate;
-
- if (yyssp >= yyss + yystacksize - 1)
- {
- /* Give user a chance to reallocate the stack */
- /* Use copies of these so that the &'s don't force the real ones into memory. */
- YYSTYPE *yyvs1 = yyvs;
- short *yyss1 = yyss;
-#ifdef YYLSP_NEEDED
- YYLTYPE *yyls1 = yyls;
-#endif
-
- /* Get the current used size of the three stacks, in elements. */
- int size = yyssp - yyss + 1;
-
-#ifdef yyoverflow
- /* Each stack pointer address is followed by the size of
- the data in use in that stack, in bytes. */
-#ifdef YYLSP_NEEDED
- /* This used to be a conditional around just the two extra args,
- but that might be undefined if yyoverflow is a macro. */
- yyoverflow("parser stack overflow",
- &yyss1, size * sizeof (*yyssp),
- &yyvs1, size * sizeof (*yyvsp),
- &yyls1, size * sizeof (*yylsp),
- &yystacksize);
-#else
- yyoverflow("parser stack overflow",
- &yyss1, size * sizeof (*yyssp),
- &yyvs1, size * sizeof (*yyvsp),
- &yystacksize);
-#endif
-
- yyss = yyss1; yyvs = yyvs1;
-#ifdef YYLSP_NEEDED
- yyls = yyls1;
-#endif
-#else /* no yyoverflow */
- /* Extend the stack our own way. */
- if (yystacksize >= YYMAXDEPTH)
- {
- yyerror("parser stack overflow");
- if (yyfree_stacks)
- {
- free (yyss);
- free (yyvs);
-#ifdef YYLSP_NEEDED
- free (yyls);
-#endif
- }
- return 2;
- }
- yystacksize *= 2;
- if (yystacksize > YYMAXDEPTH)
- yystacksize = YYMAXDEPTH;
-#ifndef YYSTACK_USE_ALLOCA
- yyfree_stacks = 1;
-#endif
- yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
- __yy_memcpy ((char *)yyss, (char *)yyss1,
- size * (unsigned int) sizeof (*yyssp));
- yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
- __yy_memcpy ((char *)yyvs, (char *)yyvs1,
- size * (unsigned int) sizeof (*yyvsp));
-#ifdef YYLSP_NEEDED
- yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
- __yy_memcpy ((char *)yyls, (char *)yyls1,
- size * (unsigned int) sizeof (*yylsp));
-#endif
-#endif /* no yyoverflow */
-
- yyssp = yyss + size - 1;
- yyvsp = yyvs + size - 1;
-#ifdef YYLSP_NEEDED
- yylsp = yyls + size - 1;
-#endif
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Stack size increased to %d\n", yystacksize);
-#endif
-
- if (yyssp >= yyss + yystacksize - 1)
- YYABORT;
- }
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Entering state %d\n", yystate);
-#endif
-
- goto yybackup;
- yybackup:
-
-/* Do appropriate processing given the current state. */
-/* Read a lookahead token if we need one and don't already have one. */
-/* yyresume: */
-
- /* First try to decide what to do without reference to lookahead token. */
-
- yyn = yypact[yystate];<