1N/A/***********************************************************************
1N/A* *
1N/A* This software is part of the ast package *
1N/A* Copyright (c) 1986-2010 AT&T Intellectual Property *
1N/A* and is licensed under the *
1N/A* Common Public License, Version 1.0 *
1N/A* by AT&T Intellectual Property *
1N/A* *
1N/A* A copy of the License is available at *
1N/A* http://www.opensource.org/licenses/cpl1.0.txt *
1N/A* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
1N/A* *
1N/A* Information and Software Systems Research *
1N/A* AT&T Research *
1N/A* Florham Park NJ *
1N/A* *
1N/A* Glenn Fowler <gsf@research.att.com> *
1N/A* *
1N/A***********************************************************************/
1N/A#pragma prototyped
1N/A/*
1N/A * Glenn Fowler
1N/A * AT&T Research
1N/A *
1N/A * preprocessor lexical analyzer definitions
1N/A */
1N/A
1N/A#ifndef _PPFSM_H
1N/A#define _PPFSM_H
1N/A
1N/A#define BITSTATE 16 /* bitsof(state) */
1N/A#define BITNONTERM 7 /* bitsof(non-terminal-state) */
1N/A#define BITTERM 7 /* bitsof(terminal-state) */
1N/A#define NMAC 19 /* number of MAC states */
1N/A
1N/A#define SPLICE (1<<BITTERM)
1N/A
1N/A#define CODE(tok,act) ((((tok)-N_PP)<<(BITTERM+1))|(act))
1N/A#define TERM(st) ((st)&((1<<(BITTERM+1))-1))
1N/A#define NEXT(st) (((st)>>(BITTERM+1))&((1<<BITNONTERM)-1))
1N/A#define QUAL(st) (((st)<<(BITTERM+1))|(S_QUAL))
1N/A#define TYPE(st) (NEXT(st)+N_PP)
1N/A
1N/A#define BACK(tok) CODE(tok,S_TOKB)
1N/A#define KEEP(tok) CODE(tok,S_TOK)
1N/A
1N/A#undef MAX
1N/A#define MAX 255
1N/A
1N/A#undef EOB
1N/A#define EOB 0
1N/A#undef EOF
1N/A#define EOF (MAX+1)
1N/A
1N/A/*
1N/A * FSM states
1N/A *
1N/A * NOTE: preserve the ranges
1N/A */
1N/A
1N/A#define INDEX(p) (((p)-fsm[0])/(MAX+1))
1N/A
1N/A#define IDSTATE(x) (((x)>=0&&INQMACRO(fsm[x]))?QID:(x))
1N/A
1N/A#define INCOMMENT(p) ((p)>=fsm[COM2]&&(p)<=fsm[COM7])
1N/A#define INCOMMENTXX(p) ((p)>=fsm[COM5]&&(p)<=fsm[COM7])
1N/A#define INQMACRO(p) ((p)>=fsm[MAC0]&&(p)<=fsm[LIT0])
1N/A#define INTMACRO(p) ((p)>=fsm[NID]&&(p)<=fsm[LIT])
1N/A#define INQUOTE(p) ((p)>=fsm[LIT1]&&(p)<=fsm[LIT2])
1N/A#define INOPSPACE(p) ((p)==fsm[BIN1])
1N/A#define INSPACE(p) ((p)==fsm[WS1])
1N/A
1N/A/*
1N/A * proto non-terminal states
1N/A */
1N/A
1N/A#define PROTO 0
1N/A#define RES1 (PROTO+1)
1N/A#define RES1a (PROTO+2)
1N/A#define RES1e (PROTO+3)
1N/A#define RES1f (PROTO+4)
1N/A#define RES1h (PROTO+5)
1N/A#define RES1l (PROTO+6)
1N/A#define RES1n (PROTO+7)
1N/A#define RES1o (PROTO+8)
1N/A#define RES1t (PROTO+9)
1N/A#define RES1x (PROTO+10)
1N/A#define RES1y (PROTO+11)
1N/A#define COM1 (PROTO+12)
1N/A#define COM2 (PROTO+13)
1N/A#define COM3 (PROTO+14)
1N/A#define COM4 (PROTO+15)
1N/A#define COM5 (PROTO+16)
1N/A#define COM6 (PROTO+17)
1N/A#define COM7 (PROTO+18)
1N/A#define NID (PROTO+19)
1N/A#define LIT (PROTO+20)
1N/A#define LIT1 (PROTO+21)
1N/A#define LIT2 (PROTO+22)
1N/A#define BAD1 (PROTO+23)
1N/A#define BAD2 (PROTO+24)
1N/A#define DOT (PROTO+25)
1N/A#define DOT2 (PROTO+26)
1N/A#define WS1 (PROTO+27)
1N/A
1N/A#if PROTOMAIN
1N/A
1N/A#define TERMINAL (PROTO+28) /* PROTOMAIN */
1N/A
1N/A#else
1N/A
1N/A/*
1N/A * quick non-terminal states
1N/A */
1N/A
1N/A#define QUICK (PROTO+28)
1N/A#define QTOK (QUICK+1)
1N/A#define QNUM (QUICK+2)
1N/A#define QEXP (QUICK+3)
1N/A#define QCOM (QUICK+4)
1N/A#define QID (QUICK+5)
1N/A#define MAC0 (QUICK+6)
1N/A#define MACN (MAC0+NMAC-1)
1N/A#define HIT0 (MACN+1)
1N/A#define HITN (HIT0+NMAC-1)
1N/A#define LIT0 (HITN+1)
1N/A#define SHARP1 (HITN+2)
1N/A
1N/A/*
1N/A * tokenize non-terminal states
1N/A */
1N/A
1N/A#define TOKEN (HITN+3)
1N/A#define OCT1 (TOKEN+1)
1N/A#define OCT2 (TOKEN+2)
1N/A#define OCT3 (TOKEN+3)
1N/A#define NOT1 (TOKEN+4)
1N/A#define PCT1 (TOKEN+5)
1N/A#define AND1 (TOKEN+6)
1N/A#define STAR1 (TOKEN+7)
1N/A#define PLUS1 (TOKEN+8)
1N/A#define MINUS1 (TOKEN+9)
1N/A#define ARROW1 (TOKEN+10)
1N/A#define COLON1 (TOKEN+11)
1N/A#define LT1 (TOKEN+12)
1N/A#define LSH1 (TOKEN+13)
1N/A#define EQ1 (TOKEN+14)
1N/A#define RSH1 (TOKEN+15)
1N/A#define GT1 (TOKEN+16)
1N/A#define CIRC1 (TOKEN+17)
1N/A#define OR1 (TOKEN+18)
1N/A#define DEC1 (TOKEN+19)
1N/A#define DEC2 (TOKEN+20)
1N/A#define HEX1 (TOKEN+21)
1N/A#define HEX2 (TOKEN+22)
1N/A#define HEX3 (TOKEN+23)
1N/A#define HEX4 (TOKEN+24)
1N/A#define HEX5 (TOKEN+25)
1N/A#define HEX6 (TOKEN+26)
1N/A#define HEX7 (TOKEN+27)
1N/A#define HEX8 (TOKEN+28)
1N/A#define DBL1 (TOKEN+29)
1N/A#define DBL2 (TOKEN+30)
1N/A#define DBL3 (TOKEN+31)
1N/A#define DBL4 (TOKEN+32)
1N/A#define DBL5 (TOKEN+33)
1N/A#define DOT1 (TOKEN+34)
1N/A#define HDR1 (TOKEN+35)
1N/A#define BIN1 (TOKEN+36)
1N/A
1N/A#define TERMINAL (TOKEN+37)
1N/A
1N/A#endif
1N/A
1N/A/*
1N/A * quick terminal states grouped together
1N/A */
1N/A
1N/A#define S_CHRB (TERMINAL+0)
1N/A#define S_COMMENT (TERMINAL+1)
1N/A#define S_EOB (TERMINAL+2)
1N/A#define S_LITBEG (TERMINAL+3)
1N/A#define S_LITEND (TERMINAL+4)
1N/A#define S_LITESC (TERMINAL+5)
1N/A#define S_MACRO (TERMINAL+6)
1N/A#define S_NL (TERMINAL+7)
1N/A#define S_QUAL (TERMINAL+8)
1N/A#define S_SHARP (TERMINAL+9)
1N/A#define S_VS (TERMINAL+10)
1N/A
1N/A/*
1N/A * and the remaining terminal states
1N/A */
1N/A
1N/A#define S_CHR (TERMINAL+11)
1N/A#define S_HUH (TERMINAL+12)
1N/A#define S_TOK (TERMINAL+13)
1N/A#define S_TOKB (TERMINAL+14)
1N/A#define S_WS (TERMINAL+15)
1N/A
1N/A#define S_RESERVED (S_HUH)
1N/A
1N/A/*
1N/A * the last terminal state (for tracing)
1N/A */
1N/A
1N/A#define LAST (S_WS)
1N/A
1N/A/*
1N/A * pseudo terminal states
1N/A */
1N/A
1N/A#define S_EOF (0)
1N/A
1N/A/*
1N/A * common lex macros
1N/A *
1N/A * NOTE: common local variable names assumed
1N/A */
1N/A
1N/A#define GET(p,c,tp,xp) \
1N/A do \
1N/A { \
1N/A if ((c = GETCHR()) == EOB && pp.in->type == IN_FILE) \
1N/A FGET(p, c, tp, xp); \
1N/A } while (0)
1N/A
1N/A#define FGET(p,c,tp,xp) \
1N/A do \
1N/A { \
1N/A if (op > xp + PPTOKSIZ) \
1N/A { \
1N/A if (!INCOMMENT(rp) && !(pp.state & (NOTEXT|SKIPCONTROL))) \
1N/A error(2, "long token truncated"); \
1N/A op = xp + PPTOKSIZ; \
1N/A } \
1N/A if ((pp.in->flags & IN_flush) && pp.level == 1 && !INMACRO(rp) && (!pp.comment || !INCOMMENT(rp)) && (c = op - pp.outbuf) > 0 && *(op - 1) == '\n') \
1N/A { \
1N/A PPWRITE(c); \
1N/A op = tp = pp.outp = pp.outbuf; \
1N/A } \
1N/A SYNCIN(); \
1N/A refill(p); \
1N/A CACHEIN(); \
1N/A if ((c = GETCHR()) == EOB) BACKIN(); \
1N/A } while (0)
1N/A
1N/A#define POP() \
1N/A do \
1N/A { \
1N/A debug((-7, "POP in=%s next=%s state=%s", ppinstr(cur), pptokchr(*prv->nextchr), pplexstr(INDEX(rp)))); \
1N/A ip = (pp.in = prv)->nextchr; \
1N/A } while (0)
1N/A
1N/A/*
1N/A * fsm implementaion globals
1N/A */
1N/A
1N/A#define fsm _pp_fsmtab
1N/A#define refill _pp_refill
1N/A#define trigraph _pp_trigraph
1N/A
1N/A/*
1N/A * first index is state, second is char, value is next state
1N/A * except for fsm[TERMINAL] where second is state+1 for EOF transition
1N/A */
1N/A
1N/Aextern short fsm[TERMINAL+1][MAX+1];
1N/A
1N/A/*
1N/A * the index is char, value is trigraph value for <?><?><char>, 0 if invalid
1N/A */
1N/A
1N/Aextern char trigraph[MAX+1];
1N/A
1N/Aextern void refill(int);
1N/A
1N/A#endif