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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef _LEX_HXX
#define _LEX_HXX
#include <hash.hxx>
#include <tools/gen.hxx>
#include <tools/stream.hxx>
#include <tools/list.hxx>
enum SVTOKEN_ENUM { SVTOKEN_EMPTY, SVTOKEN_COMMENT,
SVTOKEN_INTEGER, SVTOKEN_STRING,
SVTOKEN_BOOL, SVTOKEN_IDENTIFIER,
SVTOKEN_CHAR, SVTOKEN_RTTIBASE,
SVTOKEN_EOF, SVTOKEN_HASHID };
class BigInt;
class SvToken
{
friend class SvTokenStream;
sal_uLong nLine, nColumn;
SVTOKEN_ENUM nType;
ByteString aString;
union
{
sal_uLong nLong;
sal_Bool bBool;
char cChar;
SvStringHashEntry * pHash;
};
public:
SvToken();
SvToken( const SvToken & rObj );
SvToken( sal_uLong n );
SvToken( SVTOKEN_ENUM nTypeP, sal_Bool b );
SvToken( char c );
SvToken( SVTOKEN_ENUM nTypeP, const ByteString & rStr );
SvToken( SVTOKEN_ENUM nTypeP );
SvToken & operator = ( const SvToken & rObj );
ByteString GetTokenAsString() const;
SVTOKEN_ENUM GetType() const { return nType; }
void SetLine( sal_uLong nLineP ) { nLine = nLineP; }
sal_uLong GetLine() const { return nLine; }
void SetColumn( sal_uLong nColumnP ) { nColumn = nColumnP; }
sal_uLong GetColumn() const { return nColumn; }
sal_Bool IsEmpty() const { return nType == SVTOKEN_EMPTY; }
sal_Bool IsComment() const { return nType == SVTOKEN_COMMENT; }
sal_Bool IsInteger() const { return nType == SVTOKEN_INTEGER; }
sal_Bool IsString() const { return nType == SVTOKEN_STRING; }
sal_Bool IsBool() const { return nType == SVTOKEN_BOOL; }
sal_Bool IsIdentifierHash() const
{ return nType == SVTOKEN_HASHID; }
sal_Bool IsIdentifier() const
{
return nType == SVTOKEN_IDENTIFIER
|| nType == SVTOKEN_HASHID;
}
sal_Bool IsChar() const { return nType == SVTOKEN_CHAR; }
sal_Bool IsRttiBase() const { return nType == SVTOKEN_RTTIBASE; }
sal_Bool IsEof() const { return nType == SVTOKEN_EOF; }
const ByteString & GetString() const
{
return IsIdentifierHash()
? pHash->GetName()
: aString;
}
sal_uLong GetNumber() const { return nLong; }
sal_Bool GetBool() const { return bBool; }
char GetChar() const { return cChar; }
void SetHash( SvStringHashEntry * pHashP )
{ pHash = pHashP; nType = SVTOKEN_HASHID; }
sal_Bool HasHash() const
{ return nType == SVTOKEN_HASHID; }
SvStringHashEntry * GetHash() const { return pHash; }
sal_Bool Is( SvStringHashEntry * pEntry ) const
{ return IsIdentifierHash() && pHash == pEntry; }
};
inline SvToken::SvToken()
: nType( SVTOKEN_EMPTY ) {}
inline SvToken::SvToken( sal_uLong n )
: nType( SVTOKEN_INTEGER ), nLong( n ) {}
inline SvToken::SvToken( SVTOKEN_ENUM nTypeP, sal_Bool b )
: nType( nTypeP ), bBool( b ) {}
inline SvToken::SvToken( char c )
: nType( SVTOKEN_CHAR ), cChar( c ) {}
inline SvToken::SvToken( SVTOKEN_ENUM nTypeP, const ByteString & rStr )
: nType( nTypeP ), aString( rStr ) {}
inline SvToken::SvToken( SVTOKEN_ENUM nTypeP )
: nType( nTypeP ) {}
DECLARE_LIST( SvTokenList, SvToken * )
class SvTokenStream
{
sal_uLong nLine, nColumn;
int nBufPos;
int c; // next character
CharSet nCharSet;
char * pCharTab; // pointer to conversion table
sal_uInt16 nTabSize; // length of tabulator
ByteString aStrTrue;
ByteString aStrFalse;
sal_uLong nMaxPos;
SvFileStream * pInStream;
SvStream & rInStream;
String aFileName;
SvTokenList aTokList;
SvToken * pCurToken;
void InitCtor();
ByteString aBufStr;
int GetNextChar();
int GetFastNextChar()
{
return aBufStr.GetChar((sal_uInt16)nBufPos++);
}
void FillTokenList();
sal_uLong GetNumber();
sal_Bool MakeToken( SvToken & );
sal_Bool IsEof() const { return rInStream.IsEof(); }
void SetMax()
{
sal_uLong n = Tell();
if( n > nMaxPos )
nMaxPos = n;
}
void CalcColumn()
{
// if end of line spare calculation
if( 0 != c )
{
sal_uInt16 n = 0;
nColumn = 0;
while( n < nBufPos )
nColumn += aBufStr.GetChar(n++) == '\t' ? nTabSize : 1;
}
}
public:
SvTokenStream( const String & rFileName );
SvTokenStream( SvStream & rInStream, const String & rFileName );
~SvTokenStream();
const String & GetFileName() const { return aFileName; }
SvStream & GetStream() { return rInStream; }
void SetCharSet( CharSet nSet );
CharSet GetCharSet() const { return nCharSet; }
void SetTabSize( sal_uInt16 nTabSizeP )
{ nTabSize = nTabSizeP; }
sal_uInt16 GetTabSize() const { return nTabSize; }
SvToken * GetToken_PrevAll()
{
SvToken * pRetToken = pCurToken;
if( NULL == (pCurToken = aTokList.Prev()) )
// current pointer never null
pCurToken = pRetToken;
return pRetToken;
}
SvToken * GetToken_NextAll()
{
SvToken * pRetToken = pCurToken;
if( NULL == (pCurToken = aTokList.Next()) )
// current pointer never null
pCurToken = pRetToken;
SetMax();
return pRetToken;
}
SvToken * GetToken_Next()
{
// comments get removed initially
return GetToken_NextAll();
}
SvToken * GetToken() const { return pCurToken; }
sal_Bool Read( char cChar )
{
if( pCurToken->IsChar()
&& cChar == pCurToken->GetChar() )
{
GetToken_Next();
return sal_True;
}
else
return sal_False;
}
void ReadDelemiter()
{
if( pCurToken->IsChar()
&& (';' == pCurToken->GetChar()
|| ',' == pCurToken->GetChar()) )
{
GetToken_Next();
}
}
sal_uInt32 Tell() const
{ return aTokList.GetCurPos(); }
void Seek( sal_uInt32 nPos )
{
pCurToken = aTokList.Seek( nPos );
SetMax();
}
void SeekRel( sal_Int32 nRelPos )
{
pCurToken = aTokList.Seek( Tell() + nRelPos );
SetMax();
}
void SeekEnd()
{
pCurToken = aTokList.Seek( nMaxPos );
}
};
#endif // _LEX_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
