grammar1.c revision 86bea46b3d16c4ed0453e17f241ddbdfade76c98
1/*********************************************************** 2Copyright 1991-1995 by Stichting Mathematisch Centrum, Amsterdam, 3The Netherlands. 4 5 All Rights Reserved 6 7Permission to use, copy, modify, and distribute this software and its 8documentation for any purpose and without fee is hereby granted, 9provided that the above copyright notice appear in all copies and that 10both that copyright notice and this permission notice appear in 11supporting documentation, and that the names of Stichting Mathematisch 12Centrum or CWI or Corporation for National Research Initiatives or 13CNRI not be used in advertising or publicity pertaining to 14distribution of the software without specific, written prior 15permission. 16 17While CWI is the initial source for this software, a modified version 18is made available by the Corporation for National Research Initiatives 19(CNRI) at the Internet address ftp://ftp.python.org. 20 21STICHTING MATHEMATISCH CENTRUM AND CNRI DISCLAIM ALL WARRANTIES WITH 22REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF 23MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH 24CENTRUM OR CNRI BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL 25DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR 26PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER 27TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR 28PERFORMANCE OF THIS SOFTWARE. 29 30******************************************************************/ 31 32/* Grammar subroutines needed by parser */ 33 34#include "pgenheaders.h" 35#include "assert.h" 36#include "grammar.h" 37#include "token.h" 38 39/* Return the DFA for the given type */ 40 41dfa * 42PyGrammar_FindDFA(g, type) 43 grammar *g; 44 register int type; 45{ 46 register dfa *d; 47#if 1 48 /* Massive speed-up */ 49 d = &g->g_dfa[type - NT_OFFSET]; 50 assert(d->d_type == type); 51 return d; 52#else 53 /* Old, slow version */ 54 register int i; 55 56 for (i = g->g_ndfas, d = g->g_dfa; --i >= 0; d++) { 57 if (d->d_type == type) 58 return d; 59 } 60 assert(0); 61 /* NOTREACHED */ 62#endif 63} 64 65char * 66PyGrammar_LabelRepr(lb) 67 label *lb; 68{ 69 static char buf[100]; 70 71 if (lb->lb_type == ENDMARKER) 72 return "EMPTY"; 73 else if (ISNONTERMINAL(lb->lb_type)) { 74 if (lb->lb_str == NULL) { 75 sprintf(buf, "NT%d", lb->lb_type); 76 return buf; 77 } 78 else 79 return lb->lb_str; 80 } 81 else { 82 if (lb->lb_str == NULL) 83 return _PyParser_TokenNames[lb->lb_type]; 84 else { 85 sprintf(buf, "%.32s(%.32s)", 86 _PyParser_TokenNames[lb->lb_type], lb->lb_str); 87 return buf; 88 } 89 } 90} 91