1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
/* $Id: triefa.cP,v 1.4 2009/06/03 01:10:53 ellson Exp $ $Revision: 1.4 $ */
/* vim:set shiftwidth=4 ts=8: */
/*
This software is part of the graphviz package
Copyright (c) 1995-2004 AT&T Corp.
Licensed under the Common Public License, Version 1.0 (the "License")
Any use, reproduction or distribution of this software constitutes
acceptance of the License. A copy of the License is available at:
http://www.research.att.com/sw/license/cpl-1.0.html
(with md5 checksum 201a9e4ba08a96f5d9677315d8ce1463)
*/
/* File - TrieFA.ins.c
*
* This file contains code to be included in the scanner file using a
* generated trie-based FA.
*/
#include "triefa.h"
#ifdef UNDERLINE
static long CharMask[28] = {
0x0000001, 0x0000000, 0x0000004, 0x0000008,
0x0000010, 0x0000020, 0x0000040, 0x0000080,
0x0000100, 0x0000200, 0x0000400, 0x0000800,
0x0001000, 0x0002000, 0x0004000, 0x0008000,
0x0010000, 0x0020000, 0x0040000, 0x0080000,
0x0100000, 0x0200000, 0x0400000, 0x0800000,
0x1000000, 0x2000000, 0x4000000, 0x8000000,
};
#define IN_MASK_RANGE(C) (islower(C) || ((C) == '_'))
#define MASK_INDEX(C) ((C) - '_')
#else
static long CharMask[26] = {
0x0000001, 0x0000002, 0x0000004, 0x0000008,
0x0000010, 0x0000020, 0x0000040, 0x0000080,
0x0000100, 0x0000200, 0x0000400, 0x0000800,
0x0001000, 0x0002000, 0x0004000, 0x0008000,
0x0010000, 0x0020000, 0x0040000, 0x0080000,
0x0100000, 0x0200000, 0x0400000, 0x0800000,
0x1000000, 0x2000000
};
#define IN_MASK_RANGE(C) islower(C)
#define MASK_INDEX(C) ((C) - 'a')
#endif
static short TFA_State;
/* TFA_Init:
*
* Initialize the trie FA.
*/
#define TFA_Init() TFA_State = 0
/* TFA_Advance:
*
* Advance to the next state (or -1) on the lowercase letter c. This should be an
* inline routine, but the C++ implementation isn't advanced enough so we use a macro.
*/
#define TFA_Advance(C) { \
unsigned char c = C; \
if (TFA_State >= 0) { \
if (isupper(c)) \
c = tolower(c); \
else if (! IN_MASK_RANGE(c)) { \
TFA_State = -1; \
goto TFA_done; \
} \
if (TrieStateTbl[TFA_State].mask & CharMask[MASK_INDEX(c)]) { \
short i = TrieStateTbl[TFA_State].trans_base; \
while (TrieTransTbl[i].c != c) \
i++; \
TFA_State = TrieTransTbl[i].next_state; \
} \
else \
TFA_State = -1; \
} \
TFA_done:; \
} /* end of TFA_Advance. */
/* TFA_Definition:
*
* Return the definition (if any) associated with the current state.
*/
#define TFA_Definition() \
((TFA_State < 0) ? -1 : TrieStateTbl[TFA_State].def)
|
