dumpnode.c revision 4fd606d1f5abe38e1f42c38de1d2e895166bd0f4
#include <stdio.h>
#include <ctype.h>
#include "set.h"
#include "syn.h"
#include "hash.h"
#include "generic.h"
#ifdef __USE_PROTOS
#else
void dumpset1(s)
set s;
#endif
{
if (set_nil(s)) {
} else {
};
}
#ifdef __USE_PROTOS
#else
void dumpset(s)
set s;
#endif
{
dumpset1(s);
}
#ifdef __USE_PROTOS
#else
int isEndRule(p)
Node * p;
#endif
{
int result=0;
result=1;
};
return result;
}
#ifdef __USE_PROTOS
#else
int depth;
Predicate *p;
#endif
{
int i;
int k;
for (i=0; i<depth ; i++) {
};
if (p->expr == PRED_AND_LIST ||
p->expr == PRED_OR_LIST) {
if (p->redundant) {
};
} else {
k=set_int(p->completionSet);
if (k >= 0) {
};
k=set_int(p->completionTree);
if (k >= 0) {
};
if (p->redundant) {
};
};
for (i=0; i<depth ; i++) {
};
for (i=0; i<depth ; i++) {
};
};
};
};
}
#ifdef __USE_PROTOS
#else
void dumppred(p)
Predicate *p;
#endif
{
dumppred1(0,p);
}
#ifdef __USE_PROTOS
void dumppredtree(Predicate *p)
#else
void dumppredtree(p)
Predicate *p;
#endif
{
}
#ifdef __USE_PROTOS
void dumppredexpr(Predicate *p)
#else
void dumppredexpr(p)
Predicate *p;
#endif
{
}
#ifdef __USE_PROTOS
#else
void dt(t)
Tree *t;
#endif
{
}
#ifdef __USE_PROTOS
void d(Node * p)
#else
void d(p)
Node * p;
#endif
{
Junction *j;
RuleRefNode *r;
TokNode *t;
ActionNode *a;
if (p==NULL) {
return;
};
switch (p->ntype) {
case nJunction :
j = (Junction *) p;
switch (j->jtype ) {
case aSubBlk :
break;
case aOptBlk :
break;
case aLoopBegin :
break;
case aLoopBlk :
break;
case aPlusBlk :
break;
case EndBlk :
break;
case RuleBlk :
break;
case Generic :
break;
case EndRule :
break;
};
if (j->p2) {
} else {
};
};
};
};
break;
case nRuleRef :
r = (RuleRefNode *) p;
break;
case nToken :
t = (TokNode *) p;
fprintf(stderr, "TokNode (in rule %s line %d) token %s\n",t->rname,t->line,TerminalString(t->token));
break;
case nAction :
a =(ActionNode *) p;
if (a->is_predicate) {
dumppredexpr(a->guardpred);
if (a->ampersandPred) {
} else {
};
};
} else if (a->init_action) {
} else {
};
break;
};
}
#ifdef __USE_PROTOS
#else
Node * p;
#endif
{
d(result);
} else {
};
return result;
}
#ifdef __USE_PROTOS
#else
Node * p;
#endif
{
d(result);
} else {
};
return result;
}
#ifdef __USE_PROTOS
#else
Node * p;
#endif
{
} else {
};
return result;
}
#ifdef __USE_PROTOS
#else
void df(p)
Node * p;
#endif
{
int count=0;
d(p);
} else {
};
};
}
#ifdef __USE_PROTOS
#else
Node * p;
int target;
#endif
{
int count=0;
d(p);
} else {
};
break;
};
};
return result;
}
static int findnodeMatch;
#ifdef __USE_PROTOS
#else
Node *n;
#endif
{
Junction *j;
j=(Junction *) n;
if (j->seq == findnodeMatch) return j;
};
};
};
next=MR_advance(n);
}
#ifdef __USE_PROTOS
#else
int match;
#endif
{
Junction *j;
};
};
return result;
}