parse.c revision 7c478bd95313f5f23a4c958a745db2134aa03244
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
#ident "%Z%%M% %I% %E% SMI" /* SVr4.0 2.8 */
#define DEBUG
#include <stdio.h>
#include "awk.h"
#include "y.tab.h"
{
register Node *x;
if (x == NULL)
return(x);
}
{
return(a);
}
{
register Node *x;
x = nodealloc(1);
x->nobj = a;
x->narg[0]=b;
return(x);
}
{
register Node *x;
x = nodealloc(2);
x->nobj = a;
x->narg[0] = b;
x->narg[1] = c;
return(x);
}
{
register Node *x;
x = nodealloc(3);
x->nobj = a;
x->narg[0] = b;
x->narg[1] = c;
x->narg[2] = d;
return(x);
}
{
register Node *x;
x = nodealloc(4);
x->nobj = a;
x->narg[0] = b;
x->narg[1] = c;
x->narg[2] = d;
x->narg[3] = e;
return(x);
}
{
register Node *x;
x = node3(a,b,c,d);
return(x);
}
{
register Node *x;
x = node2(a,b,c);
return(x);
}
{
register Node *x;
x = node1(a,b);
return(x);
}
{
register Node *x;
x = node1(a,b);
return(x);
}
{
register Node *x;
x = node3(a,b,c,d);
return(x);
}
{
register Node *x;
x = node4(a,b,c,d,e);
return(x);
}
{
register Node *x;
x = node2(a,b,c);
return(x);
}
{
register Node *x;
x = node4(a,b,c,d,e);
return(x);
}
{
register Node *x;
a->csub = b;
return(x);
}
{
/* return valtonode(lookup("$0", symtab), CFLD); */
}
{
if (isvalue(p)) {
}
}
return p;
}
{
register Node *x;
paircnt++;
return(x);
}
{
register Node *c;
if (errorflag) /* don't link things that are wrong */
return a;
if (a == NULL) return(b);
else if (b == NULL) return(a);
;
c->nnext = b;
return(a);
}
Cell *v;
{
Node *p;
int n;
if (isarr(v)) {
return;
}
n = 0; /* count arguments */
n++;
v->fval = n;
}
isarg(s) /* is s in argument list for current function? */
uchar *s;
{
int n;
for (n = 0; p != 0; p = p->nnext, n++)
return n;
return -1;
}