cvsuser 04/07/31 03:03:40
Modified: . MANIFEST
config/gen/makefiles root.in
Added: ast ast.h ast.l ast.y astlexer.c astparser.c
astparser.h node.c
Log:
PAST lexer and parser
* ast lexer and parser are parsing PAST files produces e.g. by
languages/python/ast2past.py
* basic node handling
* node dump
Revision Changes Path
1.712 +7 -0 parrot/MANIFEST
Index: MANIFEST
===================================================================
RCS file: /cvs/public/parrot/MANIFEST,v
retrieving revision 1.711
retrieving revision 1.712
diff -u -w -r1.711 -r1.712
--- MANIFEST 31 Jul 2004 09:10:50 -0000 1.711
+++ MANIFEST 31 Jul 2004 10:03:18 -0000 1.712
@@ -20,6 +20,13 @@
TODO [main]doc
TODO.win32 [main]doc
VERSION [main]doc
+ast/ast.h []
+ast/ast.l []
+ast/ast.y []
+ast/astlexer.c []
+ast/astparser.c []
+ast/astparser.h []
+ast/node.c []
build_tools/build_nativecall.pl []
build_tools/c2str.pl []
build_tools/fingerprint_c.pl []
1.1 parrot/ast/ast.h
Index: ast.h
===================================================================
#if !defined(PARROT_AST_H_GUARD)
#define PARROT_AST_H_GUARD
#include "astparser.h"
typedef enum {
UNK_CTX
} context_type;
YYLTYPE noloc;
typedef struct nodeType_t* (*node_opt_t) (struct nodeType_t*);
typedef struct nodeType_t* (*node_expand_t) (struct nodeType_t*);
typedef struct nodeType_t* (*node_create_t) (int, struct nodeType_t*,
struct nodeType_t*);
typedef void (*node_dump_t) (struct nodeType_t*, int level);
typedef context_type (*node_context_t)(struct nodeType_t*, context_type);
struct _SymReg;
typedef struct nodeType_t {
node_expand_t expand;
node_opt_t opt;
node_dump_t dump;
node_context_t context;
context_type up_ctx; /* ctx coming from upper */
context_type ctx;
const char* d;
struct nodeType_t *up;
struct nodeType_t *next;
YYLTYPE loc;
union {
struct _SymReg *r;
struct nodeType_t *child;
} u;
} nodeType;
#define NODE0(p) (p)->u.child
#define NODE1(p) (p)->u.child->u.child
#ifdef AST_TEST
enum VARTYPE { /* variable type can be */
VTCONST = 1 << 0, /* constant */
VTREG = 1 << 1, /* register */
VT_UNICODE = 1 << 16 /* unicode string constant */
};
typedef struct _SymReg {
char * name;
enum VARTYPE type; /* Variable type */
int set; /* Which register set/file it belongs to */
struct _SymReg * next; /* used in the symbols hash */
} SymReg;
SymReg * mk_const(char * name, int t);
SymReg * mk_symreg(char * name, int t);
#endif
nodeType * IMCC_new_const_node(char *name, int set, YYLTYPE *loc);
nodeType * IMCC_new_node(int nr, nodeType *child, YYLTYPE *loc);
nodeType * IMCC_append_node(nodeType *head, nodeType *tail, YYLTYPE *loc);
void dump_nodes(nodeType *);
int find_node_type(const char *name);
#endif /* PARROT_AST_H_GUARD */
1.1 parrot/ast/ast.l
Index: ast.l
===================================================================
%{
/*
* ast.l
*
* Ast lexer
*
* Copyright (C) 2004 by leo
*
* The tokenizer.
*/
#include <parrot/parrot.h>
#include "ast.h"
#define YY_DECL int yylex(YYSTYPE *valp, YYLTYPE *locp, Interp *interp)
YY_DECL yylex;
extern char* str_dup(char *);
#define DUP_AND_RET(valp, token) \
do { \
if (valp) (valp)->s = str_dup(yytext); \
return token; \
} while (0)
#define YY_USER_ACTION set_loc(locp, yytext, yyleng);
static int line, col;
#define YY_USER_INIT line = col = 1;
static void
set_loc(YYLTYPE *l, char const *tok, size_t len)
{
l->first_line = line;
l->first_column = col;
l->last_line = line;
col += len;
l->last_column = col;
}
%}
%option outfile="astlexer.c"
%option nounput
LETTER [EMAIL PROTECTED]
DIGIT [0-9]
DIGITS {DIGIT}+
HEX 0x[0-9A-Fa-f]+
BIN 0b[01]+
DOT [.]
SIGN [-+]
BIGINT {SIGN}?{DIGITS}"L"
FLOATNUM
{SIGN}?(({DIGITS}{DOT}{DIGIT}*|{DOT}{DIGITS})([eE]{SIGN}?{DIGITS})?|{DIGITS}[eE]{SIGN}?{DIGITS})
LETTERDIGIT [a-zA-Z0-9_]
LABELLETTERDIGIT ([EMAIL PROTECTED]|"::")
ID {LETTER}{LABELLETTERDIGIT}*
STRINGCONSTANT \"(\\\"|[^"\n]*)*\"
ENCCHAR {LETTER}|{DIGIT}|"-"
ENCCHARS {ENCCHAR}*
ENC {LETTER}{ENCCHARS}":"
UNICODE {ENC}{STRINGCONSTANT}
CHARCONSTANT \'[^'\n]*\'
RANKSPEC \[[,]*\]
EOL \r?\n
WS [\t\f\r\x1a ]
SP [ ]
%%
"#".*{EOL} /* skip comments */ {++line; col=1; }
{EOL} { ++line; col=1; }
{WS}+ /* eat white space */ ;
{ID} {
valp->t = find_node_type(yytext);
return IDENTIFIER;
}
{FLOATNUM} DUP_AND_RET(valp, FLOATC);
{SIGN}?{DIGIT}+ DUP_AND_RET(valp, INTC);
{HEX} DUP_AND_RET(valp, INTC);
{BIN} DUP_AND_RET(valp, INTC);
{BIGINT} {
valp->s = str_dup(yytext);
valp->s[strlen(valp->s) - 1] = '\0'; /* trailing 'L' */
return(STRINGC); /* no BIGINT native format yet */
}
{STRINGCONSTANT} {
valp->s = str_dup(yytext);
return(STRINGC); /* XXX delete quotes, -> emit, pbc */
}
{UNICODE} {
char *p = strchr(yytext, '"');
valp->s = str_dup(p); /* enc:"..." */
/* TODO pass charset */
return(USTRINGC); /* XXX delete quotes, -> emit, pbc */
}
{CHARCONSTANT} {
valp->s = str_dup(yytext); /* XXX delete quotes, -> emit, pbc */
return(STRINGC);
}
. return *yytext;
<<EOF>> yyterminate();
%%
int yywrap(void) { return 1; }
1.1 parrot/ast/ast.y
Index: ast.y
===================================================================
%{
/*
* ast.y
*
* AST parser
*
* Copyright (C) 2004 by leo
*
*/
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <parrot/parrot.h>
#include "ast.h"
#include "astparser.h"
#define YYDEBUG 1
#define YYERROR_VERBOSE 1
/*
* we use a pure parser with the interpreter as a parameter
* this still doesn't make the parser reentrant, there are too
* many globals around.
* These globals should go into one structure, which could be
* attached to the interpreter
*/
static void pr_error(YYLTYPE loc, const char *s);
#undef yyerror
#define yyerror(s) pr_error(yylloc, s)
int yylex(YYSTYPE*, YYLTYPE*, Interp*);
#define YYPARSE_PARAM interp
#define YYLEX_PARAM interp
extern struct nodeType_t *top_node;
%}
%union {
int t;
char *s;
struct nodeType_t *n;
}
%token <s> STRINGC INTC FLOATC USTRINGC
%token <t> IDENTIFIER
%type <n> program nodes node term
%pure_parser
%start program
%expect 2
%%
program: nodes { top_node = $$; }
| error { pr_error(@1, "Bug"); YYABORT; }
;
nodes: node
| nodes node { $$ = IMCC_append_node($1, $2, &@1); }
| term
;
node: IDENTIFIER '(' nodes ')' { $$ = IMCC_new_node($1, $3, &@1); }
;
term: /* empty */ { $$ = 0; }
| STRINGC { $$ = IMCC_new_const_node($1, 'S', &@1); }
| INTC { $$ = IMCC_new_const_node($1, 'I', &@1); }
| FLOATC { $$ = IMCC_new_const_node($1, 'N', &@1); }
| USTRINGC { $$ = IMCC_new_const_node($1, 'U', &@1); }
;
%%
static void
pr_error(YYLTYPE l, const char *s)
{
fprintf(stdout, "%s at line %d col %d\n",
s, l.first_line, l.first_column);
}
1.1 parrot/ast/astlexer.c
<<Binary file>>
1.1 parrot/ast/astparser.c
Index: astparser.c
===================================================================
/* A Bison parser, made from ast/ast.y, by GNU bison 1.75. */
/* Skeleton parser for Yacc-like parsing with Bison,
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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. */
/* Written by Richard Stallman by simplifying the original so called
``semantic'' parser. */
/* 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. */
#define YYBISON 1
/* Pure parsers. */
#define YYPURE 1
/* Using locations. */
#define YYLSP_NEEDED 1
/* If NAME_PREFIX is specified substitute the variables and functions
names. */
#define yyparse ASTparse
#define yylex ASTlex
#define yyerror ASTerror
#define yylval ASTlval
#define yychar ASTchar
#define yydebug ASTdebug
#define yynerrs ASTnerrs
#define yylloc ASTlloc
/* Tokens. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
STRINGC = 258,
INTC = 259,
FLOATC = 260,
USTRINGC = 261,
IDENTIFIER = 262
};
#endif
#define STRINGC 258
#define INTC 259
#define FLOATC 260
#define USTRINGC 261
#define IDENTIFIER 262
/* Copy the first part of user declarations. */
#line 1 "ast/ast.y"
/*
* ast.y
*
* AST parser
*
* Copyright (C) 2004 by leo
*
*/
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <parrot/parrot.h>
#include "ast.h"
#include "astparser.h"
#define YYDEBUG 1
#define YYERROR_VERBOSE 1
/*
* we use a pure parser with the interpreter as a parameter
* this still doesn't make the parser reentrant, there are too
* many globals around.
* These globals should go into one structure, which could be
* attached to the interpreter
*/
static void pr_error(YYLTYPE loc, const char *s);
#undef yyerror
#define yyerror(s) pr_error(yylloc, s)
int yylex(YYSTYPE*, YYLTYPE*, Interp*);
#define YYPARSE_PARAM interp
#define YYLEX_PARAM interp
extern struct nodeType_t *top_node;
/* Enabling traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
#ifndef YYSTYPE
#line 43 "ast/ast.y"
typedef union {
int t;
char *s;
struct nodeType_t *n;
} yystype;
/* Line 193 of /usr/share/bison/yacc.c. */
#line 144 "ast/astparser.c"
# define YYSTYPE yystype
# define YYSTYPE_IS_TRIVIAL 1
#endif
#ifndef YYLTYPE
typedef struct yyltype
{
int first_line;
int first_column;
int last_line;
int last_column;
} yyltype;
# define YYLTYPE yyltype
# define YYLTYPE_IS_TRIVIAL 1
#endif
/* Copy the second part of user declarations. */
/* Line 213 of /usr/share/bison/yacc.c. */
#line 165 "ast/astparser.c"
#if ! defined (yyoverflow) || YYERROR_VERBOSE
/* The parser invokes alloca or malloc; define the necessary symbols. */
# if YYSTACK_USE_ALLOCA
# define YYSTACK_ALLOC alloca
# else
# ifndef YYSTACK_USE_ALLOCA
# if defined (alloca) || defined (_ALLOCA_H)
# define YYSTACK_ALLOC alloca
# else
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's `empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
# else
# if defined (__STDC__) || defined (__cplusplus)
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# endif
# define YYSTACK_ALLOC malloc
# define YYSTACK_FREE free
# endif
#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
#if (! defined (yyoverflow) \
&& (! defined (__cplusplus) \
|| (YYLTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
short yyss;
YYSTYPE yyvs;
YYLTYPE yyls;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+ 2 * YYSTACK_GAP_MAX)
/* Copy COUNT objects from FROM to TO. The source and destination do
not overlap. */
# ifndef YYCOPY
# if 1 < __GNUC__
# define YYCOPY(To, From, Count) \
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
# else
# define YYCOPY(To, From, Count) \
do \
{ \
register YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(To)[yyi] = (From)[yyi]; \
} \
while (0)
# endif
# endif
/* 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) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack, Stack, yysize); \
Stack = &yyptr->Stack; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAX; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (0)
#endif
#if defined (__STDC__) || defined (__cplusplus)
typedef signed char yysigned_char;
#else
typedef short yysigned_char;
#endif
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 12
#define YYLAST 19
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 10
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 5
/* YYNRULES -- Number of rules. */
#define YYNRULES 12
/* YYNRULES -- Number of states. */
#define YYNSTATES 16
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 262
#define YYTRANSLATE(X) \
((unsigned)(X) <= YYMAXUTOK ? yytranslate[X] : YYUNDEFTOK)
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
static const unsigned 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,
8, 9, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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
};
#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
YYRHS. */
static const unsigned char yyprhs[] =
{
0, 0, 3, 5, 7, 9, 12, 14, 19, 20,
22, 24, 26
};
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
static const yysigned_char yyrhs[] =
{
11, 0, -1, 12, -1, 1, -1, 13, -1, 12,
13, -1, 14, -1, 7, 8, 12, 9, -1, -1,
3, -1, 4, -1, 5, -1, 6, -1
};
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const unsigned char yyrline[] =
{
0, 61, 61, 62, 64, 65, 66, 69, 72, 73,
74, 75, 76
};
#endif
#if YYDEBUG || YYERROR_VERBOSE
/* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"$end", "error", "$undefined", "STRINGC", "INTC", "FLOATC", "USTRINGC",
"IDENTIFIER", "'('", "')'", "$accept", "program", "nodes", "node",
"term", 0
};
#endif
# ifdef YYPRINT
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
token YYLEX-NUM. */
static const unsigned short yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 40, 41
};
# endif
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const unsigned char yyr1[] =
{
0, 10, 11, 11, 12, 12, 12, 13, 14, 14,
14, 14, 14
};
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
static const unsigned char yyr2[] =
{
0, 2, 1, 1, 1, 2, 1, 4, 0, 1,
1, 1, 1
};
/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
STATE-NUM when YYTABLE doesn't specify something else to do. Zero
means the default is an error. */
static const unsigned char yydefact[] =
{
0, 3, 9, 10, 11, 12, 0, 0, 2, 4,
6, 8, 1, 5, 0, 7
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yysigned_char yydefgoto[] =
{
-1, 7, 8, 9, 10
};
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
#define YYPACT_NINF -7
static const yysigned_char yypact[] =
{
0, -7, -7, -7, -7, -7, 9, 15, 11, -7,
-7, 6, -7, -7, 7, -7
};
/* YYPGOTO[NTERM-NUM]. */
static const yysigned_char yypgoto[] =
{
-7, -7, 8, -6, -7
};
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule which
number is the opposite. If zero, do what YYDEFACT says.
If YYTABLE_NINF, parse error. */
#define YYTABLE_NINF -9
static const yysigned_char yytable[] =
{
-8, 1, 13, 2, 3, 4, 5, 6, 13, 2,
3, 4, 5, 6, 6, 12, 15, 11, 6, 14
};
static const unsigned char yycheck[] =
{
0, 1, 8, 3, 4, 5, 6, 7, 14, 3,
4, 5, 6, 7, 7, 0, 9, 8, 7, 11
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const unsigned char yystos[] =
{
0, 1, 3, 4, 5, 6, 7, 11, 12, 13,
14, 8, 0, 13, 12, 9
};
#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
# define YYSIZE_T __SIZE_TYPE__
#endif
#if ! defined (YYSIZE_T) && defined (size_t)
# define YYSIZE_T size_t
#endif
#if ! defined (YYSIZE_T)
# if defined (__STDC__) || defined (__cplusplus)
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# endif
#endif
#if ! defined (YYSIZE_T)
# define YYSIZE_T unsigned int
#endif
#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
/* YYLLOC_DEFAULT -- Compute the default location (before the actions
are run). */
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) \
Current.first_line = Rhs[1].first_line; \
Current.first_column = Rhs[1].first_column; \
Current.last_line = Rhs[N].last_line; \
Current.last_column = Rhs[N].last_column;
#endif
/* YYLEX -- calling `yylex' with the right arguments. */
#ifdef YYLEX_PARAM
# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM)
#else
# define YYLEX yylex (&yylval, &yylloc)
#endif
/* 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 YYDSYMPRINT(Args) \
do { \
if (yydebug) \
yysymprint Args; \
} while (0)
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YYDSYMPRINT(Args)
#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
SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#if YYMAXDEPTH == 0
# undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined (__GLIBC__) && defined (_STRING_H)
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
static YYSIZE_T
# if defined (__STDC__) || defined (__cplusplus)
yystrlen (const char *yystr)
# else
yystrlen (yystr)
const char *yystr;
# endif
{
register const char *yys = yystr;
while (*yys++ != '\0')
continue;
return yys - yystr - 1;
}
# endif
# endif
# ifndef yystpcpy
# if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
static char *
# if defined (__STDC__) || defined (__cplusplus)
yystpcpy (char *yydest, const char *yysrc)
# else
yystpcpy (yydest, yysrc)
char *yydest;
const char *yysrc;
# endif
{
register char *yyd = yydest;
register const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
#endif /* !YYERROR_VERBOSE */
#if YYDEBUG
/*-----------------------------.
| Print this symbol on YYOUT. |
`-----------------------------*/
static void
#if defined (__STDC__) || defined (__cplusplus)
yysymprint (FILE* yyout, int yytype, YYSTYPE yyvalue, YYLTYPE yylocation)
#else
yysymprint (yyout, yytype, yyvalue, yylocation)
FILE* yyout;
int yytype;
YYSTYPE yyvalue;
YYLTYPE yylocation;
#endif
{
/* Pacify ``unused variable'' warnings. */
(void) yyvalue;
(void) yylocation;
if (yytype < YYNTOKENS)
{
YYFPRINTF (yyout, "token %s (", yytname[yytype]);
# ifdef YYPRINT
YYPRINT (yyout, yytoknum[yytype], yyvalue);
# endif
}
else
YYFPRINTF (yyout, "nterm %s (", yytname[yytype]);
switch (yytype)
{
default:
break;
}
YYFPRINTF (yyout, ")");
}
#endif /* YYDEBUG. */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
static void
#if defined (__STDC__) || defined (__cplusplus)
yydestruct (int yytype, YYSTYPE yyvalue, YYLTYPE yylocation)
#else
yydestruct (yytype, yyvalue, yylocation)
int yytype;
YYSTYPE yyvalue;
YYLTYPE yylocation;
#endif
{
/* Pacify ``unused variable'' warnings. */
(void) yyvalue;
(void) yylocation;
switch (yytype)
{
default:
break;
}
}
/* 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
# if defined (__STDC__) || defined (__cplusplus)
# define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
# define YYPARSE_PARAM_DECL
# else
# define YYPARSE_PARAM_ARG YYPARSE_PARAM
# define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
# endif
#else /* !YYPARSE_PARAM */
# define YYPARSE_PARAM_ARG
# define YYPARSE_PARAM_DECL
#endif /* !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
{
/* The lookahead symbol. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Number of parse errors so far. */
int yynerrs;
/* Location data for the lookahead symbol. */
YYLTYPE yylloc;
register int yystate;
register int yyn;
int yyresult;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* Lookahead token as an internal (translated) token number. */
int yychar1 = 0;
/* 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. */
short yyssa[YYINITDEPTH];
short *yyss = yyssa;
register short *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs = yyvsa;
register YYSTYPE *yyvsp;
/* The location stack. */
YYLTYPE yylsa[YYINITDEPTH];
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
YYSIZE_T yystacksize = YYINITDEPTH;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
YYLTYPE yyloc;
/* When reducing, the number of symbols on the RHS of the reduced
rule. */
int yylen;
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;
yylsp = yyls;
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 (yyssp >= yyss + yystacksize - 1)
{
/* 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;
short *yyss1 = yyss;
YYLTYPE *yyls1 = yyls;
/* 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 ("parser stack overflow",
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yyls1, yysize * sizeof (*yylsp),
&yystacksize);
yyls = yyls1;
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyoverflowlab;
# else
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
goto yyoverflowlab;
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
{
short *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyoverflowlab;
YYSTACK_RELOCATE (yyss);
YYSTACK_RELOCATE (yyvs);
YYSTACK_RELOCATE (yyls);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
yylsp = yyls + yysize - 1;
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
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. */
/* yyresume: */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yyn == YYPACT_NINF)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* yychar is either YYEMPTY or YYEOF
or a valid token in external form. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
/* Convert token to internal form (in yychar1) for indexing tables with. */
if (yychar <= 0) /* This means end of input. */
{
yychar1 = 0;
yychar = YYEOF; /* Don't call YYLEX any more. */
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yychar1 = YYTRANSLATE (yychar);
/* We have to keep this `#if YYDEBUG', since we use variables
which are defined only if `YYDEBUG' is set. */
YYDPRINTF ((stderr, "Next token is "));
YYDSYMPRINT ((stderr, yychar1, yylval, yyloc));
YYDPRINTF ((stderr, "\n"));
}
/* If the proper action on seeing token YYCHAR1 is to reduce or to
detect an error, take that action. */
yyn += yychar1;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yychar1)
goto yydefault;
yyn = yytable[yyn];
if (yyn <= 0)
{
if (yyn == 0 || yyn == YYTABLE_NINF)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
if (yyn == YYFINAL)
YYACCEPT;
/* Shift the lookahead token. */
YYDPRINTF ((stderr, "Shifting token %d (%s), ",
yychar, yytname[yychar1]));
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
*++yylsp = yylloc;
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
yystate = yyn;
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];
/* Default location. */
YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
#if YYDEBUG
/* We have to keep this `#if YYDEBUG', since we use variables which
are defined only if `YYDEBUG' is set. */
if (yydebug)
{
int yyi;
YYFPRINTF (stderr, "Reducing via rule %d (line %d), ",
yyn - 1, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (yyi = yyprhs[yyn]; yyrhs[yyi] >= 0; yyi++)
YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]);
YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn)
{
case 2:
#line 61 "ast/ast.y"
{ top_node = yyval.n; }
break;
case 3:
#line 62 "ast/ast.y"
{ pr_error(yylsp[0], "Bug"); YYABORT; }
break;
case 5:
#line 65 "ast/ast.y"
{ yyval.n = IMCC_append_node(yyvsp[-1].n, yyvsp[0].n, &yylsp[-1]); }
break;
case 7:
#line 69 "ast/ast.y"
{ yyval.n = IMCC_new_node(yyvsp[-3].t, yyvsp[-1].n, &yylsp[-3]); }
break;
case 8:
#line 72 "ast/ast.y"
{ yyval.n = 0; }
break;
case 9:
#line 73 "ast/ast.y"
{ yyval.n = IMCC_new_const_node(yyvsp[0].s, 'S', &yylsp[0]); }
break;
case 10:
#line 74 "ast/ast.y"
{ yyval.n = IMCC_new_const_node(yyvsp[0].s, 'I', &yylsp[0]); }
break;
case 11:
#line 75 "ast/ast.y"
{ yyval.n = IMCC_new_const_node(yyvsp[0].s, 'N', &yylsp[0]); }
break;
case 12:
#line 76 "ast/ast.y"
{ yyval.n = IMCC_new_const_node(yyvsp[0].s, 'U', &yylsp[0]); }
break;
}
/* Line 1016 of /usr/share/bison/yacc.c. */
#line 1038 "ast/astparser.c"
yyvsp -= yylen;
yyssp -= yylen;
yylsp -= yylen;
#if YYDEBUG
if (yydebug)
{
short *yyssp1 = yyss - 1;
YYFPRINTF (stderr, "state stack now");
while (yyssp1 != yyssp)
YYFPRINTF (stderr, " %d", *++yyssp1);
YYFPRINTF (stderr, "\n");
}
#endif
*++yyvsp = yyval;
*++yylsp = yyloc;
/* 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
yyn = yypact[yystate];
if (YYPACT_NINF < yyn && yyn < YYLAST)
{
YYSIZE_T yysize = 0;
int yytype = YYTRANSLATE (yychar);
char *yymsg;
int yyx, yycount;
yycount = 0;
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. */
for (yyx = yyn < 0 ? -yyn : 0;
yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
yysize += yystrlen (yytname[yyx]) + 15, yycount++;
yysize += yystrlen ("parse error, unexpected ") + 1;
yysize += yystrlen (yytname[yytype]);
yymsg = (char *) YYSTACK_ALLOC (yysize);
if (yymsg != 0)
{
char *yyp = yystpcpy (yymsg, "parse error, unexpected ");
yyp = yystpcpy (yyp, yytname[yytype]);
if (yycount < 5)
{
yycount = 0;
for (yyx = yyn < 0 ? -yyn : 0;
yyx < (int) (sizeof (yytname) / sizeof (char *));
yyx++)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
{
const char *yyq = ! yycount ? ", expecting " : " or ";
yyp = yystpcpy (yyp, yyq);
yyp = yystpcpy (yyp, yytname[yyx]);
yycount++;
}
}
yyerror (yymsg);
YYSTACK_FREE (yymsg);
}
else
yyerror ("parse error; also virtual memory exhausted");
}
else
#endif /* YYERROR_VERBOSE */
yyerror ("parse error");
}
goto yyerrlab1;
/*----------------------------------------------------.
| yyerrlab1 -- error raised explicitly by an action. |
`----------------------------------------------------*/
yyerrlab1:
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse lookahead token after an
error, discard it. */
/* Return failure if at end of input. */
if (yychar == YYEOF)
{
/* Pop the error token. */
YYPOPSTACK;
/* Pop the rest of the stack. */
while (yyssp > yyss)
{
YYDPRINTF ((stderr, "Error: popping "));
YYDSYMPRINT ((stderr,
yystos[*yyssp],
*yyvsp, *yylsp));
YYDPRINTF ((stderr, "\n"));
yydestruct (yystos[*yyssp], *yyvsp, *yylsp);
YYPOPSTACK;
}
YYABORT;
}
YYDPRINTF ((stderr, "Discarding token %d (%s).\n",
yychar, yytname[yychar1]));
yydestruct (yychar1, yylval, yylloc);
yychar = YYEMPTY;
}
/* Else will try to reuse lookahead token after shifting the error
token. */
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;
YYDPRINTF ((stderr, "Error: popping "));
YYDSYMPRINT ((stderr,
yystos[*yyssp], *yyvsp, *yylsp));
YYDPRINTF ((stderr, "\n"));
yydestruct (yystos[yystate], *yyvsp, *yylsp);
yyvsp--;
yystate = *--yyssp;
yylsp--;
#if YYDEBUG
if (yydebug)
{
short *yyssp1 = yyss - 1;
YYFPRINTF (stderr, "Error: state stack now");
while (yyssp1 != yyssp)
YYFPRINTF (stderr, " %d", *++yyssp1);
YYFPRINTF (stderr, "\n");
}
#endif
}
if (yyn == YYFINAL)
YYACCEPT;
YYDPRINTF ((stderr, "Shifting error token, "));
*++yyvsp = yylval;
*++yylsp = yylloc;
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
#ifndef yyoverflow
/*----------------------------------------------.
| yyoverflowlab -- parser overflow comes here. |
`----------------------------------------------*/
yyoverflowlab:
yyerror ("parser stack overflow");
yyresult = 2;
/* Fall through. */
#endif
yyreturn:
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
return yyresult;
}
#line 79 "ast/ast.y"
static void
pr_error(YYLTYPE l, const char *s)
{
fprintf(stdout, "%s at line %d col %d\n",
s, l.first_line, l.first_column);
}
1.1 parrot/ast/astparser.h
Index: astparser.h
===================================================================
/* A Bison parser, made from ast/ast.y, by GNU bison 1.75. */
/* Skeleton parser for Yacc-like parsing with Bison,
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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. */
#ifndef BISON_AST_ASTPARSER_H
# define BISON_AST_ASTPARSER_H
/* Tokens. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
STRINGC = 258,
INTC = 259,
FLOATC = 260,
USTRINGC = 261,
IDENTIFIER = 262
};
#endif
#define STRINGC 258
#define INTC 259
#define FLOATC 260
#define USTRINGC 261
#define IDENTIFIER 262
#ifndef YYSTYPE
#line 43 "ast/ast.y"
typedef union {
int t;
char *s;
struct nodeType_t *n;
} yystype;
/* Line 1281 of /usr/share/bison/yacc.c. */
#line 60 "ast/astparser.h"
# define YYSTYPE yystype
#endif
#ifndef YYLTYPE
typedef struct yyltype
{
int first_line;
int first_column;
int last_line;
int last_column;
} yyltype;
# define YYLTYPE yyltype
#endif
#endif /* not BISON_AST_ASTPARSER_H */
1.1 parrot/ast/node.c
Index: node.c
===================================================================
#include <stdlib.h>
#include <stdio.h>
#include "ast.h"
#include "../imcc/imc.h"
static void
pr(nodeType *p)
{
if (!p)
return;
printf("Const(%s)", p->u.r->name);
}
static void
const_dump(nodeType *p, int l)
{
pr(p);
}
static nodeType*
const_expand(nodeType *p)
{
return p;
}
static void
set_const(nodeType *p)
{
p->expand = const_expand;
// p->context = const_context;
p->dump = const_dump;
p->opt = NULL;
p->d = "const";
}
static void
dump_st(nodeType *p, int l)
{
if (p) {
printf("\n%*s", l*2, "");
printf("%s(", p->d);
}
}
static void
dump_e(nodeType *p, int l)
{
if (p) {
printf(")");
}
}
static void
dump_0(nodeType *p, int l)
{
dump_st(p, l);
dump_e(p, l);
if ( p->next )
p->next->dump(p->next, l);
}
static void
dump_1(nodeType *p, int l)
{
dump_st(p, l);
if ( NODE0(p) )
NODE0(p)->dump(NODE0(p), l + 1);
dump_e(p, l);
if ( p->next )
p->next->dump(p->next, l);
}
void
dump_nodes(nodeType *p)
{
p->dump(p, 0);
printf("\n");
}
static nodeType *
new_node(YYLTYPE *loc)
{
nodeType *p;
if ((p = malloc(sizeof(nodeType))) == NULL) {
fprintf(stderr, "out of memory");
exit(1);
}
p->loc = *loc;
return p;
}
static nodeType *
new_con(YYLTYPE *loc)
{
nodeType *p = new_node(loc);
set_const(p);
return p;
}
static nodeType*
var_expand(nodeType *p)
{
return p;
}
static nodeType* create_0(int nr, nodeType *self, nodeType *p);
static nodeType* create_1(int nr, nodeType *self, nodeType *p);
typedef struct {
const char *name;
node_create_t create;
node_expand_t expand;
node_opt_t opt;
node_dump_t dump;
} node_names;
/* keep this list sorted */
static node_names ast_list[] = {
{ "--no-node", NULL, NULL, NULL, NULL },
{ "Const", NULL, NULL, NULL, const_dump },
#define CONST_NODE 1
{ "Py_Module", create_1, NULL, NULL, dump_1 },
{ "Py_Print" , create_1, NULL, NULL, dump_1 },
{ "Py_Print_nl", create_0, NULL, NULL, dump_0 },
{ "Src_File", create_1, NULL, NULL, dump_1 },
{ "Src_Line", create_1, NULL, NULL, dump_1 },
{ "Stmts", create_1, NULL, NULL, dump_1 }
};
static int
ast_comp(const void *a, const void *b)
{
const node_names *pa = (const node_names *) a;
const node_names *pb = (const node_names *) b;
return strcmp(pa->name, pb->name);
}
static void
print_node_name(int i) {
printf("%s", ast_list[i].name);
}
int find_node_type(const char *name)
{
node_names search, *r;
search.name = name;
r = bsearch(&search, ast_list, sizeof(ast_list) / sizeof(ast_list[0]),
sizeof(ast_list[0]), ast_comp);
if (!r) {
fprintf(stderr, "Unknown astnode '%s'\n", name);
exit(1);
}
return r - ast_list;
}
static void
set_fptrs(nodeType *self, int nr)
{
self->d = ast_list[nr].name;
self->expand = ast_list[nr].expand;
self->opt = ast_list[nr].opt;
self->dump = ast_list[nr].dump;
}
static nodeType*
create_0(int nr, nodeType *self, nodeType *p)
{
set_fptrs(self, nr);
return self;
}
static nodeType*
create_1(int nr, nodeType *self, nodeType *p)
{
p->up = self;
NODE0(self) = p;
set_fptrs(self, nr);
return self;
}
/*
* API
*/
nodeType *
IMCC_new_const_node(char *name, int set, YYLTYPE *loc)
{
nodeType *p = new_con(loc);
SymReg *r = mk_const(name, set);
p->u.r = r;
return p;
}
nodeType *
IMCC_new_node(int nr, nodeType *child, YYLTYPE *loc)
{
nodeType * n;
if (nr == CONST_NODE) {
return child;
}
n = new_node(loc);
return ast_list[nr].create(nr, n, child);
}
nodeType *
IMCC_append_node(nodeType *a, nodeType *b, YYLTYPE *loc)
{
nodeType *last = a;
while (last->next)
last = last->next;
last->next = b;
return a;
}
1.230 +26 -3 parrot/config/gen/makefiles/root.in
Index: root.in
===================================================================
RCS file: /cvs/public/parrot/config/gen/makefiles/root.in,v
retrieving revision 1.229
retrieving revision 1.230
diff -u -w -r1.229 -r1.230
--- root.in 20 Jul 2004 04:41:47 -0000 1.229
+++ root.in 31 Jul 2004 10:03:40 -0000 1.230
@@ -1,4 +1,4 @@
-# $Id: root.in,v 1.229 2004/07/20 04:41:47 leo Exp $
+# $Id: root.in,v 1.230 2004/07/31 10:03:40 leo Exp $
###############################################################################
#
@@ -23,8 +23,9 @@
#
###############################################################################
-# imcc dir
+# imcc, ast dir
IMCC_DIR = imcc
+AST_DIR = ast
# source dir
SRC = src
@@ -217,6 +218,15 @@
$(IMCC_DIR)/fastcall$(O) \
$(IMCC_DIR)/pcc$(O)
+AST_H_FILES = \
+ $(AST_DIR)/ast.h \
+ $(AST_DIR)/astparser.h
+
+AST_O_FILES = \
+ $(AST_DIR)/astparser$(O) \
+ $(AST_DIR)/astlexer$(O) \
+ $(AST_DIR)/node$(O)
+
GENERAL_H_FILES = $(NONGEN_HEADERS) $(GEN_HEADERS) ${TEMP_cg_h}
ICU_H_FILES = ${icu_headers}
@@ -314,7 +324,8 @@
$(INTERP_O_FILES) \
$(IO_O_FILES) $(CLASS_O_FILES) \
$(ENCODING_O_FILES) \
- $(IMCC_O_FILES)
+ $(IMCC_O_FILES) \
+ $(AST_O_FILES)
OPS_FILES = ${ops} $(GEN_OPSFILES)
@@ -908,6 +919,18 @@
$(IMCC_O_FILES) : $(IMCC_H_FILES) $(ALL_H_FILES)
+# ast files
+
+$(AST_DIR)/ast.y.flag $(AST_DIR)/astparser.c $(AST_DIR)/astparser.h :
$(AST_DIR)/ast.y
+ $(YACC) $(AST_DIR)/ast.y -d -o $(AST_DIR)/astparser.c -p AST
+ $(TOUCH) $(AST_DIR)/ast.y.flag $(AST_DIR)/astparser.c $(AST_DIR)/astparser.h
+
+$(AST_DIR)/ast.l.flag $(AST_DIR)/astlexer.c : $(AST_DIR)/ast.l
+ $(LEX) -o$(AST_DIR)/astlexer.c $(AST_DIR)/ast.l
+ $(TOUCH) $(AST_DIR)/ast.l.flag $(AST_DIR)/astlexer.c
+
+$(AST_O_FILES) : $(IMCC_H_FILES) $(AST_H_FILES) $(ALL_H_FILES)
+
###############################################################################
#
