verilog_bison.c File Reference

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "types.h"
#include "parse_making_ast.h"

Include dependency graph for verilog_bison.c:

Go to the source code of this file.

Data Structures
union	YYSTYPE
union	yyalloc
Defines
#define	YYBISON   1
#define	YYBISON_VERSION   "2.3"
#define	YYSKELETON_NAME   "yacc.c"
#define	YYPURE   0
#define	YYLSP_NEEDED   0
#define	vSYMBOL_ID   258
#define	vNUMBER_ID   259
#define	vDELAY_ID   260
#define	vALWAYS   261
#define	vAND   262
#define	vASSIGN   263
#define	vBEGIN   264
#define	vCASE   265
#define	vDEFAULT   266
#define	vDEFINE   267
#define	vELSE   268
#define	vEND   269
#define	vENDCASE   270
#define	vENDMODULE   271
#define	vIF   272
#define	vINOUT   273
#define	vINPUT   274
#define	vMODULE   275
#define	vNAND   276
#define	vNEGEDGE   277
#define	vNOR   278
#define	vNOT   279
#define	vOR   280
#define	vOUTPUT   281
#define	vPARAMETER   282
#define	vPOSEDGE   283
#define	vREG   284
#define	vWIRE   285
#define	vXNOR   286
#define	vXOR   287
#define	vDEFPARAM   288
#define	voANDAND   289
#define	voOROR   290
#define	voLTE   291
#define	voGTE   292
#define	voSLEFT   293
#define	voSRIGHT   294
#define	voEQUAL   295
#define	voNOTEQUAL   296
#define	voCASEEQUAL   297
#define	voCASENOTEQUAL   298
#define	voXNOR   299
#define	voNAND   300
#define	voNOR   301
#define	vNOT_SUPPORT   302
#define	LOWER_THAN_ELSE   303
#define	PARSE   {printf("here\n");}
#define	YYDEBUG   1
#define	YYERROR_VERBOSE   0
#define	YYTOKEN_TABLE   0
#define	yystype   YYSTYPE
#define	YYSTYPE_IS_DECLARED   1
#define	YYSTYPE_IS_TRIVIAL   1
#define	YYSIZE_T   unsigned int
#define	YYSIZE_MAXIMUM   ((YYSIZE_T) -1)
#define	YY_(msgid)   msgid
#define	YYUSE(e)   ((void) (e))
#define	YYID(n)   (n)
#define	YYSTACK_ALLOC   YYMALLOC
#define	YYSTACK_FREE   YYFREE
#define	YYSTACK_ALLOC_MAXIMUM   YYSIZE_MAXIMUM
#define	YYMALLOC   malloc
#define	YYFREE   free
#define	YYSTACK_GAP_MAXIMUM   (sizeof (union yyalloc) - 1)
#define	YYSTACK_BYTES(N)
#define	YYCOPY(To, From, Count)
#define	YYSTACK_RELOCATE(Stack)
#define	YYFINAL   9
#define	YYLAST   1279
#define	YYNTOKENS   74
#define	YYNNTS   35
#define	YYNRULES   123
#define	YYNSTATES   289
#define	YYUNDEFTOK   2
#define	YYMAXUTOK   303
#define	YYTRANSLATE(YYX)   ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
#define	YYPACT_NINF   -127
#define	YYTABLE_NINF   -1
#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 yyerrorlab
#define	YYFAIL   goto yyerrlab
#define	YYRECOVERING()   (!!yyerrstatus)
#define	YYBACKUP(Token, Value)
#define	YYTERROR   1
#define	YYERRCODE   256
#define	YYRHSLOC(Rhs, K)   ((Rhs)[K])
#define	YYLLOC_DEFAULT(Current, Rhs, N)
#define	YY_LOCATION_PRINT(File, Loc)   ((void) 0)
#define	YYLEX   yylex ()
#define	YYFPRINTF   fprintf
#define	YYDPRINTF(Args)
#define	YY_SYMBOL_PRINT(Title, Type, Value, Location)
#define	YY_STACK_PRINT(Bottom, Top)
#define	YY_REDUCE_PRINT(Rule)
#define	YYINITDEPTH   200
#define	YYMAXDEPTH   10000
#define	YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N))
Typedefs
typedef union YYSTYPE	YYSTYPE
typedef unsigned char	yytype_uint8
typedef short int	yytype_int8
typedef unsigned short int	yytype_uint16
typedef short int	yytype_int16
Enumerations
enum	yytokentype {   vSYMBOL_ID = 258, vNUMBER_ID = 259, vDELAY_ID = 260, vALWAYS = 261,   vAND = 262, vASSIGN = 263, vBEGIN = 264, vCASE = 265,   vDEFAULT = 266, vDEFINE = 267, vELSE = 268, vEND = 269,   vENDCASE = 270, vENDMODULE = 271, vIF = 272, vINOUT = 273,   vINPUT = 274, vMODULE = 275, vNAND = 276, vNEGEDGE = 277,   vNOR = 278, vNOT = 279, vOR = 280, vOUTPUT = 281,   vPARAMETER = 282, vPOSEDGE = 283, vREG = 284, vWIRE = 285,   vXNOR = 286, vXOR = 287, vDEFPARAM = 288, voANDAND = 289,   voOROR = 290, voLTE = 291, voGTE = 292, voSLEFT = 293,   voSRIGHT = 294, voEQUAL = 295, voNOTEQUAL = 296, voCASEEQUAL = 297,   voCASENOTEQUAL = 298, voXNOR = 299, voNAND = 300, voNOR = 301,   vNOT_SUPPORT = 302, LOWER_THAN_ELSE = 303, vSYMBOL_ID = 258, vNUMBER_ID = 259,   vDELAY_ID = 260, vALWAYS = 261, vAND = 262, vASSIGN = 263,   vBEGIN = 264, vCASE = 265, vDEFAULT = 266, vDEFINE = 267,   vELSE = 268, vEND = 269, vENDCASE = 270, vENDMODULE = 271,   vIF = 272, vINOUT = 273, vINPUT = 274, vMODULE = 275,   vNAND = 276, vNEGEDGE = 277, vNOR = 278, vNOT = 279,   vOR = 280, vOUTPUT = 281, vPARAMETER = 282, vPOSEDGE = 283,   vREG = 284, vWIRE = 285, vXNOR = 286, vXOR = 287,   vDEFPARAM = 288, voANDAND = 289, voOROR = 290, voLTE = 291,   voGTE = 292, voSLEFT = 293, voSRIGHT = 294, voEQUAL = 295,   voNOTEQUAL = 296, voCASEEQUAL = 297, voCASENOTEQUAL = 298, voXNOR = 299,   voNAND = 300, voNOR = 301, vNOT_SUPPORT = 302, LOWER_THAN_ELSE = 303 }
Functions
yylineno void	yyerror (const char *str)
int	yywrap ()
int	yyparse ()
int	yylex (void)
static void	yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const *const yyvaluep)
static void	yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const *const yyvaluep)
static void	yy_stack_print (yytype_int16 *bottom, yytype_int16 *top)
static void	yy_reduce_print (YYSTYPE *yyvsp, int yyrule)
static void	yydestruct (char *yymsg, int yytype, YYSTYPE *yyvaluep) const
Variables
int	yylineno
static const yytype_uint8	yytranslate []
static const yytype_uint16	yyprhs []
static const yytype_int8	yyrhs []
static const yytype_uint16	yyrline []
static const char *const	yytname []
static const yytype_uint8	yyr1 []
static const yytype_uint8	yyr2 []
static const yytype_uint8	yydefact []
static const yytype_int16	yydefgoto []
static const yytype_int16	yypact []
static const yytype_int16	yypgoto []
static const yytype_uint16	yytable []
static const yytype_int16	yycheck []
static const yytype_uint8	yystos []
int	yydebug
int	yychar
YYSTYPE	yylval
int	yynerrs

---

Define Documentation

#define LOWER_THAN_ELSE   303

Definition at line 163 of file verilog_bison.c.

#define PARSE   {printf("here\n");}

Definition at line 201 of file verilog_bison.c.

#define vALWAYS   261

Definition at line 121 of file verilog_bison.c.

#define vAND   262

Definition at line 122 of file verilog_bison.c.

#define vASSIGN   263

Definition at line 123 of file verilog_bison.c.

#define vBEGIN   264

Definition at line 124 of file verilog_bison.c.

#define vCASE   265

Definition at line 125 of file verilog_bison.c.

#define vDEFAULT   266

Definition at line 126 of file verilog_bison.c.

#define vDEFINE   267

Definition at line 127 of file verilog_bison.c.

#define vDEFPARAM   288

Definition at line 148 of file verilog_bison.c.

#define vDELAY_ID   260

Definition at line 120 of file verilog_bison.c.

#define vELSE   268

Definition at line 128 of file verilog_bison.c.

#define vEND   269

Definition at line 129 of file verilog_bison.c.

#define vENDCASE   270

Definition at line 130 of file verilog_bison.c.

#define vENDMODULE   271

Definition at line 131 of file verilog_bison.c.

#define vIF   272

Definition at line 132 of file verilog_bison.c.

#define vINOUT   273

Definition at line 133 of file verilog_bison.c.

#define vINPUT   274

Definition at line 134 of file verilog_bison.c.

#define vMODULE   275

Definition at line 135 of file verilog_bison.c.

#define vNAND   276

Definition at line 136 of file verilog_bison.c.

#define vNEGEDGE   277

Definition at line 137 of file verilog_bison.c.

#define vNOR   278

Definition at line 138 of file verilog_bison.c.

#define vNOT   279

Definition at line 139 of file verilog_bison.c.

#define vNOT_SUPPORT   302

Definition at line 162 of file verilog_bison.c.

#define vNUMBER_ID   259

Definition at line 119 of file verilog_bison.c.

#define voANDAND   289

Definition at line 149 of file verilog_bison.c.

#define voCASEEQUAL   297

Definition at line 157 of file verilog_bison.c.

#define voCASENOTEQUAL   298

Definition at line 158 of file verilog_bison.c.

#define voEQUAL   295

Definition at line 155 of file verilog_bison.c.

#define voGTE   292

Definition at line 152 of file verilog_bison.c.

#define voLTE   291

Definition at line 151 of file verilog_bison.c.

#define voNAND   300

Definition at line 160 of file verilog_bison.c.

#define voNOR   301

Definition at line 161 of file verilog_bison.c.

#define voNOTEQUAL   296

Definition at line 156 of file verilog_bison.c.

#define voOROR   290

Definition at line 150 of file verilog_bison.c.

#define vOR   280

Definition at line 140 of file verilog_bison.c.

#define voSLEFT   293

Definition at line 153 of file verilog_bison.c.

#define voSRIGHT   294

Definition at line 154 of file verilog_bison.c.

#define vOUTPUT   281

Definition at line 141 of file verilog_bison.c.

#define voXNOR   299

Definition at line 159 of file verilog_bison.c.

#define vPARAMETER   282

Definition at line 142 of file verilog_bison.c.

#define vPOSEDGE   283

Definition at line 143 of file verilog_bison.c.

#define vREG   284

Definition at line 144 of file verilog_bison.c.

#define vSYMBOL_ID   258

Definition at line 118 of file verilog_bison.c.

#define vWIRE   285

Definition at line 145 of file verilog_bison.c.

#define vXNOR   286

Definition at line 146 of file verilog_bison.c.

#define vXOR   287

Definition at line 147 of file verilog_bison.c.

#define YY_

(

msgid

)

msgid

Definition at line 327 of file verilog_bison.c.

#define YY_LOCATION_PRINT	(	File,
		Loc		)	((void) 0)

Definition at line 1184 of file verilog_bison.c.

#define YY_REDUCE_PRINT

(

Rule

)

Value:

do {                                    \
  if (yydebug)                          \
    yy_reduce_print (yyvsp, Rule); \
} while (YYID (0))

Definition at line 1341 of file verilog_bison.c.

#define YY_STACK_PRINT	(	Bottom,
		Top		)

Value:

do {                                                            \
  if (yydebug)                                                  \
    yy_stack_print ((Bottom), (Top));                           \
} while (YYID (0))

Definition at line 1303 of file verilog_bison.c.

#define YY_SYMBOL_PRINT	(	Title,
		Type,
		Value,
		Location		)

Value:

do {                                                                      \
  if (yydebug)                                                            \
    {                                                                     \
      YYFPRINTF (stderr, "%s ", Title);                                   \
      yy_symbol_print (stderr,                                            \
                  Type, Value); \
      YYFPRINTF (stderr, "\n");                                           \
    }                                                                     \
} while (YYID (0))

Definition at line 1211 of file verilog_bison.c.

#define YYABORT   goto yyabortlab

Definition at line 1113 of file verilog_bison.c.

#define YYACCEPT   goto yyacceptlab

Definition at line 1112 of file verilog_bison.c.

#define YYBACKUP	(	Token,
		Value		)

Value:

do                                                              \
  if (yychar == YYEMPTY && yylen == 1)                          \
    {                                                           \
      yychar = (Token);                                         \
      yylval = (Value);                                         \
      yytoken = YYTRANSLATE (yychar);                           \
      YYPOPSTACK (1);                                           \
      goto yybackup;                                            \
    }                                                           \
  else                                                          \
    {                                                           \
      yyerror (YY_("syntax error: cannot back up")); \
      YYERROR;                                                  \
    }                                                           \
while (YYID (0))

Definition at line 1125 of file verilog_bison.c.

#define YYBISON   1

Definition at line 47 of file verilog_bison.c.

#define YYBISON_VERSION   "2.3"

Definition at line 50 of file verilog_bison.c.

#define yyclearin   (yychar = YYEMPTY)

Definition at line 1108 of file verilog_bison.c.

#define YYCOPY	(	To,
		From,
		Count		)

Value:

do                                      \
        {                                       \
          YYSIZE_T yyi;                         \
          for (yyi = 0; yyi < (Count); yyi++)   \
            (To)[yyi] = (From)[yyi];            \
        }                                       \
      while (YYID (0))

Definition at line 453 of file verilog_bison.c.

#define YYDEBUG   1

Definition at line 232 of file verilog_bison.c.

#define YYDPRINTF

(

Args

)

Value:

do {                                            \
  if (yydebug)                                  \
    YYFPRINTF Args;                             \
} while (YYID (0))

Definition at line 1205 of file verilog_bison.c.

#define YYEMPTY   (-2)

Definition at line 1109 of file verilog_bison.c.

#define YYEOF   0

Definition at line 1110 of file verilog_bison.c.

#define YYERRCODE   256

Definition at line 1144 of file verilog_bison.c.

#define yyerrok   (yyerrstatus = 0)

Definition at line 1107 of file verilog_bison.c.

#define YYERROR   goto yyerrorlab

Definition at line 1114 of file verilog_bison.c.

#define YYERROR_VERBOSE   0

Definition at line 240 of file verilog_bison.c.

#define YYFAIL   goto yyerrlab

Definition at line 1121 of file verilog_bison.c.

#define YYFINAL   9

Definition at line 483 of file verilog_bison.c.

#define YYFPRINTF   fprintf

Definition at line 1202 of file verilog_bison.c.

#define YYFREE   free

Definition at line 416 of file verilog_bison.c.

#define YYID

(

n

)

(n)

Definition at line 340 of file verilog_bison.c.

#define YYINITDEPTH   200

Definition at line 1360 of file verilog_bison.c.

#define YYLAST   1279

Definition at line 485 of file verilog_bison.c.

#define YYLEX   yylex ()

Definition at line 1194 of file verilog_bison.c.

#define YYLLOC_DEFAULT	(	Current,
		Rhs,
		N		)

Value:

do                                                                      \
      if (YYID (N))                                                    \
        {                                                               \
          (Current).first_line   = YYRHSLOC (Rhs, 1).first_line;        \
          (Current).first_column = YYRHSLOC (Rhs, 1).first_column;      \
          (Current).last_line    = YYRHSLOC (Rhs, N).last_line;         \
          (Current).last_column  = YYRHSLOC (Rhs, N).last_column;       \
        }                                                               \
      else                                                              \
        {                                                               \
          (Current).first_line   = (Current).last_line   =              \
            YYRHSLOC (Rhs, 0).last_line;                                \
          (Current).first_column = (Current).last_column =              \
            YYRHSLOC (Rhs, 0).last_column;                              \
        }                                                               \
    while (YYID (0))

Definition at line 1153 of file verilog_bison.c.

#define YYLSP_NEEDED   0

Definition at line 59 of file verilog_bison.c.

#define YYMALLOC   malloc

Definition at line 409 of file verilog_bison.c.

#define YYMAXDEPTH   10000

Definition at line 1371 of file verilog_bison.c.

#define YYMAXUTOK   303

Definition at line 498 of file verilog_bison.c.

#define YYNNTS   35

Definition at line 490 of file verilog_bison.c.

#define YYNRULES   123

Definition at line 492 of file verilog_bison.c.

#define YYNSTATES   289

Definition at line 494 of file verilog_bison.c.

#define YYNTOKENS   74

Definition at line 488 of file verilog_bison.c.

#define YYPACT_NINF   -127

Definition at line 760 of file verilog_bison.c.

#define YYPOPSTACK

(

N

)

(yyvsp -= (N), yyssp -= (N))

#define YYPURE   0

Definition at line 56 of file verilog_bison.c.

 

#define YYRECOVERING

(

)

(!!yyerrstatus)

Definition at line 1123 of file verilog_bison.c.

#define YYRHSLOC	(	Rhs,
		K		)	((Rhs)[K])

Definition at line 1151 of file verilog_bison.c.

#define YYSIZE_MAXIMUM   ((YYSIZE_T) -1)

Definition at line 317 of file verilog_bison.c.

#define YYSIZE_T   unsigned int

Definition at line 313 of file verilog_bison.c.

#define YYSKELETON_NAME   "yacc.c"

Definition at line 53 of file verilog_bison.c.

#define YYSTACK_ALLOC   YYMALLOC

Definition at line 395 of file verilog_bison.c.

#define YYSTACK_ALLOC_MAXIMUM   YYSIZE_MAXIMUM

Definition at line 398 of file verilog_bison.c.

#define YYSTACK_BYTES

(

N

)

Value:

((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
      + YYSTACK_GAP_MAXIMUM)

Definition at line 442 of file verilog_bison.c.

#define YYSTACK_FREE   YYFREE

Definition at line 396 of file verilog_bison.c.

#define YYSTACK_GAP_MAXIMUM   (sizeof (union yyalloc) - 1)

Definition at line 438 of file verilog_bison.c.

#define YYSTACK_RELOCATE

(

Stack

)

Value:

do                                                                      \
      {                                                                 \
        YYSIZE_T yynewbytes;                                            \
        YYCOPY (&yyptr->Stack, Stack, yysize);                          \
        Stack = &yyptr->Stack;                                          \
        yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
        yyptr += yynewbytes / sizeof (*yyptr);                          \
      }                                                                 \
    while (YYID (0))

Definition at line 469 of file verilog_bison.c.

#define yystype   YYSTYPE

Definition at line 259 of file verilog_bison.c.

#define YYSTYPE_IS_DECLARED   1

Definition at line 260 of file verilog_bison.c.

#define YYSTYPE_IS_TRIVIAL   1

Definition at line 261 of file verilog_bison.c.

#define YYTABLE_NINF   -1

Definition at line 807 of file verilog_bison.c.

#define YYTERROR   1

Definition at line 1143 of file verilog_bison.c.

#define YYTOKEN_TABLE   0

Definition at line 245 of file verilog_bison.c.

#define YYTRANSLATE

(

YYX

)

((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)

Definition at line 500 of file verilog_bison.c.

#define YYUNDEFTOK   2

Definition at line 497 of file verilog_bison.c.

#define YYUSE

(

e

)

((void) (e))

Definition at line 333 of file verilog_bison.c.

---

Typedef Documentation

typedef union YYSTYPE YYSTYPE

typedef short int yytype_int16

Definition at line 300 of file verilog_bison.c.

typedef short int yytype_int8

Definition at line 288 of file verilog_bison.c.

typedef unsigned short int yytype_uint16

Definition at line 294 of file verilog_bison.c.

typedef unsigned char yytype_uint8

Definition at line 279 of file verilog_bison.c.

---

Enumeration Type Documentation

enum yytokentype

Enumerator:

vSYMBOL_ID
vNUMBER_ID
vDELAY_ID
vALWAYS
vAND
vASSIGN
vBEGIN
vCASE
vDEFAULT
vDEFINE
vELSE
vEND
vENDCASE
vENDMODULE
vIF
vINOUT
vINPUT
vMODULE
vNAND
vNEGEDGE
vNOR
vNOT
vOR
vOUTPUT
vPARAMETER
vPOSEDGE
vREG
vWIRE
vXNOR
vXOR
vDEFPARAM
voANDAND
voOROR
voLTE
voGTE
voSLEFT
voSRIGHT
voEQUAL
voNOTEQUAL
voCASEEQUAL
voCASENOTEQUAL
voXNOR
voNAND
voNOR
vNOT_SUPPORT
LOWER_THAN_ELSE
vSYMBOL_ID
vNUMBER_ID
vDELAY_ID
vALWAYS
vAND
vASSIGN
vBEGIN
vCASE
vDEFAULT
vDEFINE
vELSE
vEND
vENDCASE
vENDMODULE
vIF
vINOUT
vINPUT
vMODULE
vNAND
vNEGEDGE
vNOR
vNOT
vOR
vOUTPUT
vPARAMETER
vPOSEDGE
vREG
vWIRE
vXNOR
vXOR
vDEFPARAM
voANDAND
voOROR
voLTE
voGTE
voSLEFT
voSRIGHT
voEQUAL
voNOTEQUAL
voCASEEQUAL
voCASENOTEQUAL
voXNOR
voNAND
voNOR
vNOT_SUPPORT
LOWER_THAN_ELSE

Definition at line 68 of file verilog_bison.c.

                    {
     vSYMBOL_ID = 258,
     vNUMBER_ID = 259,
     vDELAY_ID = 260,
     vALWAYS = 261,
     vAND = 262,
     vASSIGN = 263,
     vBEGIN = 264,
     vCASE = 265,
     vDEFAULT = 266,
     vDEFINE = 267,
     vELSE = 268,
     vEND = 269,
     vENDCASE = 270,
     vENDMODULE = 271,
     vIF = 272,
     vINOUT = 273,
     vINPUT = 274,
     vMODULE = 275,
     vNAND = 276,
     vNEGEDGE = 277,
     vNOR = 278,
     vNOT = 279,
     vOR = 280,
     vOUTPUT = 281,
     vPARAMETER = 282,
     vPOSEDGE = 283,
     vREG = 284,
     vWIRE = 285,
     vXNOR = 286,
     vXOR = 287,
     vDEFPARAM = 288,
     voANDAND = 289,
     voOROR = 290,
     voLTE = 291,
     voGTE = 292,
     voSLEFT = 293,
     voSRIGHT = 294,
     voEQUAL = 295,
     voNOTEQUAL = 296,
     voCASEEQUAL = 297,
     voCASENOTEQUAL = 298,
     voXNOR = 299,
     voNAND = 300,
     voNOR = 301,
     vNOT_SUPPORT = 302,
     LOWER_THAN_ELSE = 303
   };

---

Function Documentation

static void yy_reduce_print	(	YYSTYPE *	yyvsp,
		int	yyrule
	)			[static]

Definition at line 1320 of file verilog_bison.c.

{
  int yynrhs = yyr2[yyrule];
  int yyi;
  unsigned long int yylno = yyrline[yyrule];
  YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
             yyrule - 1, yylno);
  /* The symbols being reduced.  */
  for (yyi = 0; yyi < yynrhs; yyi++)
    {
      fprintf (stderr, "   $%d = ", yyi + 1);
      yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
                       &(yyvsp[(yyi + 1) - (yynrhs)])
                                       );
      fprintf (stderr, "\n");
    }
}

Here is the call graph for this function:

static void yy_stack_print	(	yytype_int16 *	bottom,
		yytype_int16 *	top
	)			[static]

Definition at line 1292 of file verilog_bison.c.

{
  YYFPRINTF (stderr, "Stack now");
  for (; bottom <= top; ++bottom)
    YYFPRINTF (stderr, " %d", *bottom);
  YYFPRINTF (stderr, "\n");
}

static void yy_symbol_print	(	FILE *	yyoutput,
		int	yytype,
		YYSTYPE const * const	yyvaluep
	)			[static]

Definition at line 1266 of file verilog_bison.c.

{
  if (yytype < YYNTOKENS)
    YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
  else
    YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);

  yy_symbol_value_print (yyoutput, yytype, yyvaluep);
  YYFPRINTF (yyoutput, ")");
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void yy_symbol_value_print	(	FILE *	yyoutput,
		int	yytype,
		YYSTYPE const * const	yyvaluep
	)			[static]

Definition at line 1234 of file verilog_bison.c.

{
  if (!yyvaluep)
    return;
# ifdef YYPRINT
  if (yytype < YYNTOKENS)
    YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# else
  YYUSE (yyoutput);
# endif
  switch (yytype)
    {
      default:
        break;
    }
}

Here is the caller graph for this function:

static void yydestruct	(	char *	yymsg,
		int	yytype,
		YYSTYPE *	yyvaluep
	)			const [static]

Definition at line 1598 of file verilog_bison.c.

{
  YYUSE (yyvaluep);

  if (!yymsg)
    yymsg = "Deleting";
  YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);

  switch (yytype)
    {

      default:
        break;
    }
}

Here is the caller graph for this function:

void yyerror

(

const char *

str

)

Definition at line 216 of file verilog_bison.c.

{
        fprintf(stderr,"error in parsing: %s - on line number %d\n",str, yylineno);
        exit(-1);
}

Here is the caller graph for this function:

int yylex

(

void

)

int yyparse

(

void

)

Definition at line 1669 of file verilog_bison.c.

{
  
  int yystate;
  int yyn;
  int yyresult;
  /* Number of tokens to shift before error messages enabled.  */
  int yyerrstatus;
  /* Look-ahead token as an internal (translated) token number.  */
  int yytoken = 0;
#if YYERROR_VERBOSE
  /* Buffer for error messages, and its allocated size.  */
  char yymsgbuf[128];
  char *yymsg = yymsgbuf;
  YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif

  /* Three stacks and their tools:
     `yyss': related to states,
     `yyvs': related to semantic values,
     `yyls': related to locations.

     Refer to the stacks thru separate pointers, to allow yyoverflow
     to reallocate them elsewhere.  */

  /* The state stack.  */
  yytype_int16 yyssa[YYINITDEPTH];
  yytype_int16 *yyss = yyssa;
  yytype_int16 *yyssp;

  /* The semantic value stack.  */
  YYSTYPE yyvsa[YYINITDEPTH];
  YYSTYPE *yyvs = yyvsa;
  YYSTYPE *yyvsp;



#define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N))

  YYSIZE_T yystacksize = YYINITDEPTH;

  /* The variables used to return semantic value and location from the
     action routines.  */
  YYSTYPE yyval;


  /* 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"));

  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;
  yyvsp = yyvs;

  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:
  *yyssp = yystate;

  if (yyss + yystacksize - 1 <= yyssp)
    {
      /* Get the current used size of the three stacks, in elements.  */
      YYSIZE_T yysize = yyssp - yyss + 1;

#ifdef 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.  */
        YYSTYPE *yyvs1 = yyvs;
        yytype_int16 *yyss1 = yyss;


        /* 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 * sizeof (*yyssp),
                    &yyvs1, yysize * sizeof (*yyvsp),

                    &yystacksize);

        yyss = yyss1;
        yyvs = yyvs1;
      }
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
      goto yyexhaustedlab;
# else
      /* Extend the stack our own way.  */
      if (YYMAXDEPTH <= yystacksize)
        goto yyexhaustedlab;
      yystacksize *= 2;
      if (YYMAXDEPTH < yystacksize)
        yystacksize = YYMAXDEPTH;

      {
        yytype_int16 *yyss1 = yyss;
        union yyalloc *yyptr =
          (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
        if (! yyptr)
          goto yyexhaustedlab;
        YYSTACK_RELOCATE (yyss);
        YYSTACK_RELOCATE (yyvs);

#  undef YYSTACK_RELOCATE
        if (yyss1 != yyssa)
          YYSTACK_FREE (yyss1);
      }
# endif
#endif /* no yyoverflow */

      yyssp = yyss + yysize - 1;
      yyvsp = yyvs + yysize - 1;


      YYDPRINTF ((stderr, "Stack size increased to %lu\n",
                  (unsigned long int) yystacksize));

      if (yyss + yystacksize - 1 <= yyssp)
        YYABORT;
    }

  YYDPRINTF ((stderr, "Entering state %d\n", yystate));

  goto yybackup;

/*-----------.
| yybackup.  |
`-----------*/
yybackup:

  /* Do appropriate processing given the current state.  Read a
     look-ahead token if we need one and don't already have one.  */

  /* First try to decide what to do without reference to look-ahead token.  */
  yyn = yypact[yystate];
  if (yyn == YYPACT_NINF)
    goto yydefault;

  /* Not known => get a look-ahead token if don't already have one.  */

  /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol.  */
  if (yychar == YYEMPTY)
    {
      YYDPRINTF ((stderr, "Reading a token: "));
      yychar = YYLEX;
    }

  if (yychar <= YYEOF)
    {
      yychar = yytoken = YYEOF;
      YYDPRINTF ((stderr, "Now at end of input.\n"));
    }
  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 (yyn == 0 || yyn == YYTABLE_NINF)
        goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }

  if (yyn == YYFINAL)
    YYACCEPT;

  /* Count tokens shifted since error; after three, turn off error
     status.  */
  if (yyerrstatus)
    yyerrstatus--;

  /* Shift the look-ahead token.  */
  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);

  /* Discard the shifted token unless it is eof.  */
  if (yychar != YYEOF)
    yychar = YYEMPTY;

  yystate = yyn;
  *++yyvsp = yylval;

  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 2:
#line 97 "SRC/verilog_bison.y"
    {next_parsed_verilog_file((yyvsp[(1) - (1)].node));;}
    break;

  case 3:
#line 100 "SRC/verilog_bison.y"
    {
                                                                                        if ((yyvsp[(1) - (2)].node) != NULL)
                                                                                        {
                                                                                                (yyval.node) = newList_entry((yyvsp[(1) - (2)].node), (yyvsp[(2) - (2)].node));
                                                                                        }
                                                                                        else
                                                                                        {
                                                                                                (yyval.node) = newList(FILE_ITEMS, (yyvsp[(2) - (2)].node));
                                                                                        }
                                                                                ;}
    break;

  case 4:
#line 110 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (2)].node);;}
    break;

  case 5:
#line 111 "SRC/verilog_bison.y"
    {(yyval.node) = newList(FILE_ITEMS, (yyvsp[(1) - (1)].node));;}
    break;

  case 6:
#line 112 "SRC/verilog_bison.y"
    {(yyval.node) = NULL;;}
    break;

  case 7:
#line 115 "SRC/verilog_bison.y"
    {(yyval.node) = NULL; newConstant((yyvsp[(2) - (3)].id_name), (yyvsp[(3) - (3)].num_value), yylineno);;}
    break;

  case 8:
#line 118 "SRC/verilog_bison.y"
    {(yyval.node) = newModule((yyvsp[(2) - (8)].id_name), (yyvsp[(4) - (8)].node), (yyvsp[(7) - (8)].node), yylineno);;}
    break;

  case 9:
#line 119 "SRC/verilog_bison.y"
    {(yyval.node) = newModule((yyvsp[(2) - (9)].id_name), (yyvsp[(4) - (9)].node), (yyvsp[(8) - (9)].node), yylineno);;}
    break;

  case 10:
#line 120 "SRC/verilog_bison.y"
    {(yyval.node) = newModule((yyvsp[(2) - (7)].id_name), NULL, (yyvsp[(6) - (7)].node), yylineno);;}
    break;

  case 11:
#line 123 "SRC/verilog_bison.y"
    {(yyval.node) = newList_entry((yyvsp[(1) - (2)].node), (yyvsp[(2) - (2)].node));;}
    break;

  case 12:
#line 124 "SRC/verilog_bison.y"
    {(yyval.node) = newList(MODULE_ITEMS, (yyvsp[(1) - (1)].node));;}
    break;

  case 13:
#line 127 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 14:
#line 128 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 15:
#line 129 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 16:
#line 130 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 17:
#line 131 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 18:
#line 132 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 19:
#line 133 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 20:
#line 134 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 21:
#line 135 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 22:
#line 139 "SRC/verilog_bison.y"
    {(yyval.node) = markAndProcessSymbolListWith(PARAMETER, (yyvsp[(2) - (3)].node));;}
    break;

  case 23:
#line 142 "SRC/verilog_bison.y"
    {(yyval.node) = markAndProcessSymbolListWith(INPUT, (yyvsp[(2) - (3)].node));;}
    break;

  case 24:
#line 145 "SRC/verilog_bison.y"
    {(yyval.node) = markAndProcessSymbolListWith(OUTPUT, (yyvsp[(2) - (3)].node));;}
    break;

  case 25:
#line 148 "SRC/verilog_bison.y"
    {(yyval.node) = markAndProcessSymbolListWith(INOUT, (yyvsp[(2) - (3)].node));;}
    break;

  case 26:
#line 151 "SRC/verilog_bison.y"
    {(yyval.node) = markAndProcessSymbolListWith(WIRE, (yyvsp[(2) - (3)].node));;}
    break;

  case 27:
#line 152 "SRC/verilog_bison.y"
    {(yyval.node) = markAndProcessSymbolListWith(REG, (yyvsp[(2) - (3)].node));;}
    break;

  case 28:
#line 155 "SRC/verilog_bison.y"
    {(yyval.node) = newList_entry((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node));;}
    break;

  case 29:
#line 156 "SRC/verilog_bison.y"
    {(yyval.node) = newList(VAR_DECLARE_LIST, (yyvsp[(1) - (1)].node));;}
    break;

  case 30:
#line 159 "SRC/verilog_bison.y"
    {(yyval.node) = newVarDeclare((yyvsp[(1) - (1)].id_name), NULL, NULL, NULL, NULL, NULL, yylineno);;}
    break;

  case 31:
#line 160 "SRC/verilog_bison.y"
    {(yyval.node) = newVarDeclare((yyvsp[(6) - (6)].id_name), (yyvsp[(2) - (6)].node), (yyvsp[(4) - (6)].node), NULL, NULL, NULL, yylineno);;}
    break;

  case 32:
#line 161 "SRC/verilog_bison.y"
    {(yyval.node) = newVarDeclare((yyvsp[(6) - (11)].id_name), (yyvsp[(2) - (11)].node), (yyvsp[(4) - (11)].node), (yyvsp[(8) - (11)].node), (yyvsp[(10) - (11)].node), NULL, yylineno);;}
    break;

  case 33:
#line 162 "SRC/verilog_bison.y"
    {(yyval.node) = newVarDeclare((yyvsp[(6) - (8)].id_name), (yyvsp[(2) - (8)].node), (yyvsp[(4) - (8)].node), NULL, NULL, (yyvsp[(8) - (8)].node), yylineno);;}
    break;

  case 34:
#line 163 "SRC/verilog_bison.y"
    {(yyval.node) = newVarDeclare((yyvsp[(1) - (3)].id_name), NULL, NULL, NULL, NULL, (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 35:
#line 166 "SRC/verilog_bison.y"
    {(yyval.node) = newAssign((yyvsp[(2) - (3)].node), yylineno);;}
    break;

  case 36:
#line 170 "SRC/verilog_bison.y"
    {(yyval.node) = newGate(BITWISE_AND, (yyvsp[(2) - (3)].node), yylineno);;}
    break;

  case 37:
#line 171 "SRC/verilog_bison.y"
    {(yyval.node) = newGate(BITWISE_NAND, (yyvsp[(2) - (3)].node), yylineno);;}
    break;

  case 38:
#line 172 "SRC/verilog_bison.y"
    {(yyval.node) = newGate(BITWISE_NOR, (yyvsp[(2) - (3)].node), yylineno);;}
    break;

  case 39:
#line 173 "SRC/verilog_bison.y"
    {(yyval.node) = newGate(BITWISE_NOT, (yyvsp[(2) - (3)].node), yylineno);;}
    break;

  case 40:
#line 174 "SRC/verilog_bison.y"
    {(yyval.node) = newGate(BITWISE_OR, (yyvsp[(2) - (3)].node), yylineno);;}
    break;

  case 41:
#line 175 "SRC/verilog_bison.y"
    {(yyval.node) = newGate(BITWISE_XNOR, (yyvsp[(2) - (3)].node), yylineno);;}
    break;

  case 42:
#line 176 "SRC/verilog_bison.y"
    {(yyval.node) = newGate(BITWISE_XOR, (yyvsp[(2) - (3)].node), yylineno);;}
    break;

  case 43:
#line 179 "SRC/verilog_bison.y"
    {(yyval.node) = newGateInstance((yyvsp[(1) - (8)].id_name), (yyvsp[(3) - (8)].node), (yyvsp[(5) - (8)].node), (yyvsp[(7) - (8)].node), yylineno);;}
    break;

  case 44:
#line 180 "SRC/verilog_bison.y"
    {(yyval.node) = newGateInstance(NULL, (yyvsp[(2) - (7)].node), (yyvsp[(4) - (7)].node), (yyvsp[(6) - (7)].node), yylineno);;}
    break;

  case 45:
#line 181 "SRC/verilog_bison.y"
    {(yyval.node) = newGateInstance((yyvsp[(1) - (6)].id_name), (yyvsp[(3) - (6)].node), (yyvsp[(5) - (6)].node), NULL, yylineno);;}
    break;

  case 46:
#line 182 "SRC/verilog_bison.y"
    {(yyval.node) = newGateInstance(NULL, (yyvsp[(2) - (5)].node), (yyvsp[(4) - (5)].node), NULL, yylineno);;}
    break;

  case 47:
#line 186 "SRC/verilog_bison.y"
    {(yyval.node) = newModuleInstance((yyvsp[(1) - (2)].id_name), (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 48:
#line 189 "SRC/verilog_bison.y"
    {(yyval.node) = newModuleNamedInstance((yyvsp[(1) - (5)].id_name), (yyvsp[(3) - (5)].node), yylineno);;}
    break;

  case 49:
#line 190 "SRC/verilog_bison.y"
    {(yyval.node) = newModuleNamedInstance((yyvsp[(1) - (4)].id_name), NULL, yylineno);;}
    break;

  case 50:
#line 193 "SRC/verilog_bison.y"
    {(yyval.node) = newList_entry((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node));;}
    break;

  case 51:
#line 194 "SRC/verilog_bison.y"
    {(yyval.node) = newList(MODULE_CONNECT_LIST, (yyvsp[(1) - (1)].node));;}
    break;

  case 52:
#line 197 "SRC/verilog_bison.y"
    {(yyval.node) = newModuleConnection((yyvsp[(2) - (5)].id_name), (yyvsp[(4) - (5)].node), yylineno);;}
    break;

  case 53:
#line 198 "SRC/verilog_bison.y"
    {(yyval.node) = newModuleConnection(NULL, (yyvsp[(1) - (1)].node), yylineno);;}
    break;

  case 54:
#line 202 "SRC/verilog_bison.y"
    {(yyval.node) = newAlways((yyvsp[(2) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 55:
#line 205 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 56:
#line 206 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (2)].node);;}
    break;

  case 57:
#line 207 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (2)].node);;}
    break;

  case 58:
#line 208 "SRC/verilog_bison.y"
    {(yyval.node) = newIf((yyvsp[(3) - (5)].node), (yyvsp[(5) - (5)].node), NULL, yylineno);;}
    break;

  case 59:
#line 209 "SRC/verilog_bison.y"
    {(yyval.node) = newIf((yyvsp[(3) - (7)].node), (yyvsp[(5) - (7)].node), (yyvsp[(7) - (7)].node), yylineno);;}
    break;

  case 60:
#line 210 "SRC/verilog_bison.y"
    {(yyval.node) = newCase((yyvsp[(3) - (6)].node), (yyvsp[(5) - (6)].node), yylineno);;}
    break;

  case 61:
#line 211 "SRC/verilog_bison.y"
    {(yyval.node) = NULL;;}
    break;

  case 62:
#line 214 "SRC/verilog_bison.y"
    {(yyval.node) = newBlocking((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 63:
#line 215 "SRC/verilog_bison.y"
    {(yyval.node) = newBlocking((yyvsp[(1) - (4)].node), (yyvsp[(4) - (4)].node), yylineno);;}
    break;

  case 64:
#line 218 "SRC/verilog_bison.y"
    {(yyval.node) = newNonBlocking((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 65:
#line 219 "SRC/verilog_bison.y"
    {(yyval.node) = newNonBlocking((yyvsp[(1) - (4)].node), (yyvsp[(4) - (4)].node), yylineno);;}
    break;

  case 66:
#line 222 "SRC/verilog_bison.y"
    {(yyval.node) = newList_entry((yyvsp[(1) - (2)].node), (yyvsp[(2) - (2)].node));;}
    break;

  case 67:
#line 223 "SRC/verilog_bison.y"
    {(yyval.node) = newList(CASE_LIST, (yyvsp[(1) - (1)].node));;}
    break;

  case 68:
#line 226 "SRC/verilog_bison.y"
    {(yyval.node) = newCaseItem((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 69:
#line 227 "SRC/verilog_bison.y"
    {(yyval.node) = newDefaultCase((yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 70:
#line 230 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(2) - (3)].node);;}
    break;

  case 71:
#line 233 "SRC/verilog_bison.y"
    {(yyval.node) = newList_entry((yyvsp[(1) - (2)].node), (yyvsp[(2) - (2)].node));;}
    break;

  case 72:
#line 234 "SRC/verilog_bison.y"
    {(yyval.node) = newList(BLOCK, (yyvsp[(1) - (1)].node));;}
    break;

  case 73:
#line 237 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(3) - (4)].node);;}
    break;

  case 74:
#line 241 "SRC/verilog_bison.y"
    {(yyval.node) = newList_entry((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node));;}
    break;

  case 75:
#line 242 "SRC/verilog_bison.y"
    {(yyval.node) = newList(DELAY_CONTROL, (yyvsp[(1) - (1)].node));;}
    break;

  case 76:
#line 245 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 77:
#line 246 "SRC/verilog_bison.y"
    {(yyval.node) = newPosedgeSymbol((yyvsp[(2) - (2)].id_name), yylineno);;}
    break;

  case 78:
#line 247 "SRC/verilog_bison.y"
    {(yyval.node) = newNegedgeSymbol((yyvsp[(2) - (2)].id_name), yylineno);;}
    break;

  case 79:
#line 250 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(1) - (1)].node);;}
    break;

  case 80:
#line 251 "SRC/verilog_bison.y"
    {(yyval.node) = newUnaryOperation(ADD, (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 81:
#line 252 "SRC/verilog_bison.y"
    {(yyval.node) = newUnaryOperation(MINUS, (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 82:
#line 253 "SRC/verilog_bison.y"
    {(yyval.node) = newUnaryOperation(BITWISE_NOT, (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 83:
#line 254 "SRC/verilog_bison.y"
    {(yyval.node) = newUnaryOperation(BITWISE_AND, (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 84:
#line 255 "SRC/verilog_bison.y"
    {(yyval.node) = newUnaryOperation(BITWISE_OR, (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 85:
#line 256 "SRC/verilog_bison.y"
    {(yyval.node) = newUnaryOperation(BITWISE_NAND, (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 86:
#line 257 "SRC/verilog_bison.y"
    {(yyval.node) = newUnaryOperation(BITWISE_NOR, (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 87:
#line 258 "SRC/verilog_bison.y"
    {(yyval.node) = newUnaryOperation(BITWISE_XNOR, (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 88:
#line 259 "SRC/verilog_bison.y"
    {(yyval.node) = newUnaryOperation(LOGICAL_NOT, (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 89:
#line 260 "SRC/verilog_bison.y"
    {(yyval.node) = newUnaryOperation(BITWISE_XOR, (yyvsp[(2) - (2)].node), yylineno);;}
    break;

  case 90:
#line 261 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(BITWISE_XOR, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 91:
#line 262 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(MULTIPLY, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 92:
#line 263 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(DIVIDE, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 93:
#line 264 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(MODULO, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 94:
#line 265 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(ADD, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 95:
#line 266 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(MINUS, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 96:
#line 267 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(BITWISE_AND, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 97:
#line 268 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(BITWISE_OR, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 98:
#line 269 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(BITWISE_NAND, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 99:
#line 270 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(BITWISE_NOR, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 100:
#line 271 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(BITWISE_XNOR, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 101:
#line 272 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(LT, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 102:
#line 273 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(GT, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 103:
#line 274 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(SR, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 104:
#line 275 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(SL, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 105:
#line 276 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(LOGICAL_EQUAL, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 106:
#line 277 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(NOT_EQUAL, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 107:
#line 278 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(LTE, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 108:
#line 279 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(GTE, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 109:
#line 280 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(CASE_EQUAL, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 110:
#line 281 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(CASE_NOT_EQUAL, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 111:
#line 282 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(LOGICAL_OR, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 112:
#line 283 "SRC/verilog_bison.y"
    {(yyval.node) = newBinaryOperation(LOGICAL_AND, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), yylineno);;}
    break;

  case 113:
#line 284 "SRC/verilog_bison.y"
    {(yyval.node) = newIfQuestion((yyvsp[(1) - (5)].node), (yyvsp[(3) - (5)].node), (yyvsp[(5) - (5)].node), yylineno);;}
    break;

  case 114:
#line 285 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(2) - (3)].node);;}
    break;

  case 115:
#line 289 "SRC/verilog_bison.y"
    {(yyval.node) = newListReplicate( (yyvsp[(2) - (6)].node), (yyvsp[(4) - (6)].node) ); ;}
    break;

  case 116:
#line 290 "SRC/verilog_bison.y"
    {(yyval.node) = newListReplicate( (yyvsp[(2) - (6)].node), (yyvsp[(4) - (6)].node) ); ;}
    break;

  case 117:
#line 293 "SRC/verilog_bison.y"
    {(yyval.node) = newNumberNode((yyvsp[(1) - (1)].num_value), yylineno);;}
    break;

  case 118:
#line 294 "SRC/verilog_bison.y"
    {(yyval.node) = newSymbolNode((yyvsp[(1) - (1)].id_name), yylineno);;}
    break;

  case 119:
#line 295 "SRC/verilog_bison.y"
    {(yyval.node) = newArrayRef((yyvsp[(1) - (4)].id_name), (yyvsp[(3) - (4)].node), yylineno);;}
    break;

  case 120:
#line 296 "SRC/verilog_bison.y"
    {(yyval.node) = newRangeRef((yyvsp[(1) - (6)].id_name), (yyvsp[(3) - (6)].node), (yyvsp[(5) - (6)].node), yylineno);;}
    break;

  case 121:
#line 297 "SRC/verilog_bison.y"
    {(yyval.node) = (yyvsp[(2) - (3)].node); ((yyvsp[(2) - (3)].node))->types.concat.num_bit_strings = -1;;}
    break;

  case 122:
#line 300 "SRC/verilog_bison.y"
    {(yyval.node) = newList_entry((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node)); /* note this will be in order lsb = greatest to msb = 0 in the node child list */;}
    break;

  case 123:
#line 301 "SRC/verilog_bison.y"
    {(yyval.node) = newList(CONCATENATE, (yyvsp[(1) - (1)].node));;}
    break;


/* Line 1267 of yacc.c.  */
#line 2540 "SRC/verilog_bison.c"
      default: break;
    }
  YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);

  YYPOPSTACK (yylen);
  yylen = 0;
  YY_STACK_PRINT (yyss, yyssp);

  *++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.  */

  yyn = yyr1[yyn];

  yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
  if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
    yystate = yytable[yystate];
  else
    yystate = yydefgoto[yyn - YYNTOKENS];

  goto yynewstate;


/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
  /* If not already recovering from an error, report this error.  */
  if (!yyerrstatus)
    {
      ++yynerrs;
#if ! YYERROR_VERBOSE
      yyerror (YY_("syntax error"));
#else
      {
        YYSIZE_T yysize = yysyntax_error (0, yystate, yychar);
        if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM)
          {
            YYSIZE_T yyalloc = 2 * yysize;
            if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM))
              yyalloc = YYSTACK_ALLOC_MAXIMUM;
            if (yymsg != yymsgbuf)
              YYSTACK_FREE (yymsg);
            yymsg = (char *) YYSTACK_ALLOC (yyalloc);
            if (yymsg)
              yymsg_alloc = yyalloc;
            else
              {
                yymsg = yymsgbuf;
                yymsg_alloc = sizeof yymsgbuf;
              }
          }

        if (0 < yysize && yysize <= yymsg_alloc)
          {
            (void) yysyntax_error (yymsg, yystate, yychar);
            yyerror (yymsg);
          }
        else
          {
            yyerror (YY_("syntax error"));
            if (yysize != 0)
              goto yyexhaustedlab;
          }
      }
#endif
    }



  if (yyerrstatus == 3)
    {
      /* If just tried and failed to reuse look-ahead 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 look-ahead token after shifting the error
     token.  */
  goto yyerrlab1;


/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR.  |
`---------------------------------------------------*/
yyerrorlab:

  /* Pacify compilers like GCC when the user code never invokes
     YYERROR and the label yyerrorlab therefore never appears in user
     code.  */
  if (/*CONSTCOND*/ 0)
     goto yyerrorlab;

  /* Do not reclaim the symbols of the rule which 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.  */

  for (;;)
    {
      yyn = yypact[yystate];
      if (yyn != YYPACT_NINF)
        {
          yyn += YYTERROR;
          if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
            {
              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",
                  yystos[yystate], yyvsp);
      YYPOPSTACK (1);
      yystate = *yyssp;
      YY_STACK_PRINT (yyss, yyssp);
    }

  if (yyn == YYFINAL)
    YYACCEPT;

  *++yyvsp = yylval;


  /* Shift the error token.  */
  YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);

  yystate = yyn;
  goto yynewstate;


/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here.  |
`-------------------------------------*/
yyacceptlab:
  yyresult = 0;
  goto yyreturn;

/*-----------------------------------.
| yyabortlab -- YYABORT comes here.  |
`-----------------------------------*/
yyabortlab:
  yyresult = 1;
  goto yyreturn;

#ifndef yyoverflow
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here.  |
`-------------------------------------------------*/
yyexhaustedlab:
  yyerror (YY_("memory exhausted"));
  yyresult = 2;
  /* Fall through.  */
#endif

yyreturn:
  if (yychar != YYEOF && yychar != YYEMPTY)
     yydestruct ("Cleanup: discarding lookahead",
                 yytoken, &yylval);
  /* Do not reclaim the symbols of the rule which action triggered
     this YYABORT or YYACCEPT.  */
  YYPOPSTACK (yylen);
  YY_STACK_PRINT (yyss, yyssp);
  while (yyssp != yyss)
    {
      yydestruct ("Cleanup: popping",
                  yystos[*yyssp], yyvsp);
      YYPOPSTACK (1);
    }
#ifndef yyoverflow
  if (yyss != yyssa)
    YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
  if (yymsg != yymsgbuf)
    YYSTACK_FREE (yymsg);
#endif
  /* Make sure YYID is used.  */
  return YYID (yyresult);
}

Here is the call graph for this function:

Here is the caller graph for this function:

int yywrap

(

void

)

Definition at line 223 of file verilog_bison.c.

{
        return 1;
}

---

Variable Documentation

int yychar

Definition at line 1638 of file verilog_bison.c.

const yytype_int16 yycheck[] [static]

Definition at line 940 of file verilog_bison.c.

int yydebug

Definition at line 1349 of file verilog_bison.c.

const yytype_uint8 yydefact[] [static]

Definition at line 716 of file verilog_bison.c.

const yytype_int16 yydefgoto[] [static]

Initial value:

{
      -1,     3,     4,     5,     6,    57,    58,    59,    60,    61,
      62,    63,    17,    18,    64,    65,   117,    66,   112,   206,
     207,    67,   172,   173,   174,   267,   268,   175,   215,   114,
     211,   212,   208,    36,    79
}

Definition at line 750 of file verilog_bison.c.

int yylineno

Definition at line 204 of file verilog_bison.c.

YYSTYPE yylval

Definition at line 1641 of file verilog_bison.c.

int yynerrs

Definition at line 1644 of file verilog_bison.c.

const yytype_int16 yypact[] [static]

Definition at line 761 of file verilog_bison.c.

const yytype_int16 yypgoto[] [static]

Initial value:

{
    -127,  -127,  -127,   221,   222,   -84,   -37,  -127,  -127,  -127,
    -127,  -127,   -35,   -36,  -127,  -127,   122,  -127,  -127,  -127,
      -4,  -127,  -126,   187,  -127,  -127,   -33,  -127,  -127,  -127,
    -127,    -5,    20,   -19,    99
}

Definition at line 795 of file verilog_bison.c.

const yytype_uint16 yyprhs[] [static]

Initial value:

{
       0,     0,     3,     5,     8,    11,    13,    15,    19,    28,
      38,    46,    49,    51,    53,    55,    57,    59,    61,    63,
      65,    67,    69,    73,    77,    81,    85,    89,    93,    97,
      99,   101,   108,   120,   129,   133,   137,   141,   145,   149,
     153,   157,   161,   165,   174,   182,   189,   195,   198,   204,
     209,   213,   215,   221,   223,   227,   229,   232,   235,   241,
     249,   256,   258,   262,   267,   271,   276,   279,   281,   285,
     289,   293,   296,   298,   303,   307,   309,   311,   314,   317,
     319,   322,   325,   328,   331,   334,   337,   340,   343,   346,
     349,   353,   357,   361,   365,   369,   373,   377,   381,   385,
     389,   393,   397,   401,   405,   409,   413,   417,   421,   425,
     429,   433,   437,   441,   447,   451,   458,   465,   467,   469,
     474,   481,   485,   489
}

Definition at line 542 of file verilog_bison.c.

const yytype_uint8 yyr1[] [static]

Initial value:

{
       0,    74,    75,    76,    76,    76,    76,    77,    78,    78,
      78,    79,    79,    80,    80,    80,    80,    80,    80,    80,
      80,    80,    81,    82,    83,    84,    85,    85,    86,    86,
      87,    87,    87,    87,    87,    88,    89,    89,    89,    89,
      89,    89,    89,    90,    90,    90,    90,    91,    92,    92,
      93,    93,    94,    94,    95,    96,    96,    96,    96,    96,
      96,    96,    97,    97,    98,    98,    99,    99,   100,   100,
     101,   102,   102,   103,   104,   104,   105,   105,   105,   106,
     106,   106,   106,   106,   106,   106,   106,   106,   106,   106,
     106,   106,   106,   106,   106,   106,   106,   106,   106,   106,
     106,   106,   106,   106,   106,   106,   106,   106,   106,   106,
     106,   106,   106,   106,   106,   106,   106,   107,   107,   107,
     107,   107,   108,   108
}

Definition at line 678 of file verilog_bison.c.

const yytype_uint8 yyr2[] [static]

Initial value:

{
       0,     2,     1,     2,     2,     1,     1,     3,     8,     9,
       7,     2,     1,     1,     1,     1,     1,     1,     1,     1,
       1,     1,     3,     3,     3,     3,     3,     3,     3,     1,
       1,     6,    11,     8,     3,     3,     3,     3,     3,     3,
       3,     3,     3,     8,     7,     6,     5,     2,     5,     4,
       3,     1,     5,     1,     3,     1,     2,     2,     5,     7,
       6,     1,     3,     4,     3,     4,     2,     1,     3,     3,
       3,     2,     1,     4,     3,     1,     1,     2,     2,     1,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       3,     3,     3,     3,     3,     3,     3,     3,     3,     3,
       3,     3,     3,     3,     3,     3,     3,     3,     3,     3,
       3,     3,     3,     5,     3,     6,     6,     1,     1,     4,
       6,     3,     3,     1
}

Definition at line 696 of file verilog_bison.c.

const yytype_int8 yyrhs[] [static]

Definition at line 560 of file verilog_bison.c.

const yytype_uint16 yyrline[] [static]

Initial value:

{
       0,    97,    97,   100,   110,   111,   112,   115,   118,   119,
     120,   123,   124,   127,   128,   129,   130,   131,   132,   133,
     134,   135,   139,   142,   145,   148,   151,   152,   155,   156,
     159,   160,   161,   162,   163,   166,   170,   171,   172,   173,
     174,   175,   176,   179,   180,   181,   182,   186,   189,   190,
     193,   194,   197,   198,   202,   205,   206,   207,   208,   209,
     210,   211,   214,   215,   218,   219,   222,   223,   226,   227,
     230,   233,   234,   237,   241,   242,   245,   246,   247,   250,
     251,   252,   253,   254,   255,   256,   257,   258,   259,   260,
     261,   262,   263,   264,   265,   266,   267,   268,   269,   270,
     271,   272,   273,   274,   275,   276,   277,   278,   279,   280,
     281,   282,   283,   284,   285,   289,   290,   293,   294,   295,
     296,   297,   300,   301
}

Definition at line 615 of file verilog_bison.c.

const yytype_uint8 yystos[] [static]

Definition at line 1074 of file verilog_bison.c.

const yytype_uint16 yytable[] [static]

Definition at line 808 of file verilog_bison.c.

const char* const yytname[] [static]

Initial value:

{
  "$end", "error", "$undefined", "vSYMBOL_ID", "vNUMBER_ID", "vDELAY_ID",
  "vALWAYS", "vAND", "vASSIGN", "vBEGIN", "vCASE", "vDEFAULT", "vDEFINE",
  "vELSE", "vEND", "vENDCASE", "vENDMODULE", "vIF", "vINOUT", "vINPUT",
  "vMODULE", "vNAND", "vNEGEDGE", "vNOR", "vNOT", "vOR", "vOUTPUT",
  "vPARAMETER", "vPOSEDGE", "vREG", "vWIRE", "vXNOR", "vXOR", "vDEFPARAM",
  "voANDAND", "voOROR", "voLTE", "voGTE", "voSLEFT", "voSRIGHT", "voEQUAL",
  "voNOTEQUAL", "voCASEEQUAL", "voCASENOTEQUAL", "voXNOR", "voNAND",
  "voNOR", "vNOT_SUPPORT", "'?'", "':'", "'|'", "'^'", "'&'", "'<'", "'>'",
  "'+'", "'-'", "'*'", "'/'", "'%'", "'('", "')'", "'{'", "'}'", "'['",
  "']'", "'~'", "'!'", "LOWER_THAN_ELSE", "';'", "','", "'='", "'.'",
  "'@'", "$accept", "source_text", "items", "define", "module",
  "list_of_module_items", "module_item", "parameter_declaration",
  "input_declaration", "output_declaration", "inout_declaration",
  "net_declaration", "variable_list", "variable", "continuous_assign",
  "gate_declaration", "gate_instance", "module_instantiation",
  "module_instance", "list_of_module_connections", "module_connection",
  "always", "statement", "blocking_assignment", "non_blocking_assignment",
  "case_item_list", "case_items", "seq_block", "stmt_list",
  "delay_control", "event_expression_list", "event_expression",
  "expression", "primary", "expression_list", 0
}

Definition at line 636 of file verilog_bison.c.

const yytype_uint8 yytranslate[] [static]

Definition at line 504 of file verilog_bison.c.