cpython/Parser/grammar1.c

67 lines
1.4 KiB
C
Raw Normal View History

1991-02-19 08:39:46 -04:00
/***********************************************************
2000-06-30 20:50:40 -03:00
Copyright (c) 2000, BeOpen.com.
Copyright (c) 1995-2000, Corporation for National Research Initiatives.
Copyright (c) 1990-1995, Stichting Mathematisch Centrum.
All rights reserved.
1991-02-19 08:39:46 -04:00
2000-06-30 20:50:40 -03:00
See the file "Misc/COPYRIGHT" for information on usage and
redistribution of this file, and for a DISCLAIMER OF ALL WARRANTIES.
1991-02-19 08:39:46 -04:00
******************************************************************/
1990-10-14 09:07:46 -03:00
/* Grammar subroutines needed by parser */
1990-12-20 11:06:42 -04:00
#include "pgenheaders.h"
1990-10-14 09:07:46 -03:00
#include "assert.h"
#include "grammar.h"
#include "token.h"
/* Return the DFA for the given type */
dfa *
PyGrammar_FindDFA(grammar *g, register int type)
1990-10-14 09:07:46 -03:00
{
register dfa *d;
#if 1
/* Massive speed-up */
d = &g->g_dfa[type - NT_OFFSET];
assert(d->d_type == type);
return d;
#else
/* Old, slow version */
register int i;
1990-10-14 09:07:46 -03:00
for (i = g->g_ndfas, d = g->g_dfa; --i >= 0; d++) {
if (d->d_type == type)
return d;
}
assert(0);
/* NOTREACHED */
#endif
1990-10-14 09:07:46 -03:00
}
char *
PyGrammar_LabelRepr(label *lb)
1990-10-14 09:07:46 -03:00
{
static char buf[100];
if (lb->lb_type == ENDMARKER)
return "EMPTY";
else if (ISNONTERMINAL(lb->lb_type)) {
if (lb->lb_str == NULL) {
sprintf(buf, "NT%d", lb->lb_type);
return buf;
}
else
return lb->lb_str;
}
else {
if (lb->lb_str == NULL)
1997-04-29 18:03:06 -03:00
return _PyParser_TokenNames[lb->lb_type];
1990-10-14 09:07:46 -03:00
else {
sprintf(buf, "%.32s(%.32s)",
1997-04-29 18:03:06 -03:00
_PyParser_TokenNames[lb->lb_type], lb->lb_str);
1990-10-14 09:07:46 -03:00
return buf;
}
}
}