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
263
264
265
266
267
268
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#ifndef INCLUDED_IDL_INC_LEX_HXX
#define INCLUDED_IDL_INC_LEX_HXX
#include <boost/ptr_container/ptr_vector.hpp>
#include <sal/types.h>
#include <hash.hxx>
#include <tools/stream.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 SvToken
{
friend class SvTokenStream;
sal_uLong nLine, nColumn;
SVTOKEN_ENUM nType;
OString aString;
union
{
sal_uLong nLong;
bool bBool;
char cChar;
SvStringHashEntry * pHash;
};
public:
SvToken();
SvToken( const SvToken & rObj );
SvToken( sal_uLong n );
SvToken( SVTOKEN_ENUM nTypeP, bool b );
SvToken( char c );
SvToken( SVTOKEN_ENUM nTypeP, const OString& rStr );
SvToken( SVTOKEN_ENUM nTypeP );
SvToken & operator = ( const SvToken & rObj );
OString 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; }
bool IsEmpty() const { return nType == SVTOKEN_EMPTY; }
bool IsComment() const { return nType == SVTOKEN_COMMENT; }
bool IsInteger() const { return nType == SVTOKEN_INTEGER; }
bool IsString() const { return nType == SVTOKEN_STRING; }
bool IsBool() const { return nType == SVTOKEN_BOOL; }
bool IsIdentifierHash() const
{ return nType == SVTOKEN_HASHID; }
bool IsIdentifier() const
{
return nType == SVTOKEN_IDENTIFIER
|| nType == SVTOKEN_HASHID;
}
bool IsChar() const { return nType == SVTOKEN_CHAR; }
bool IsRttiBase() const { return nType == SVTOKEN_RTTIBASE; }
bool IsEof() const { return nType == SVTOKEN_EOF; }
const OString& GetString() const
{
return IsIdentifierHash()
? pHash->GetName()
: aString;
}
sal_uLong GetNumber() const { return nLong; }
bool GetBool() const { return bBool; }
char GetChar() const { return cChar; }
void SetHash( SvStringHashEntry * pHashP )
{ pHash = pHashP; nType = SVTOKEN_HASHID; }
bool HasHash() const
{ return nType == SVTOKEN_HASHID; }
SvStringHashEntry * GetHash() const { return pHash; }
bool Is( SvStringHashEntry * pEntry ) const
{ return IsIdentifierHash() && pHash == pEntry; }
};
inline SvToken::SvToken()
: nLine(0)
, nColumn(0)
, nType( SVTOKEN_EMPTY )
{
}
inline SvToken::SvToken( sal_uLong n )
: nType( SVTOKEN_INTEGER ), nLong( n ) {}
inline SvToken::SvToken( SVTOKEN_ENUM nTypeP, bool b )
: nType( nTypeP ), bBool( b ) {}
inline SvToken::SvToken( char c )
: nType( SVTOKEN_CHAR ), cChar( c ) {}
inline SvToken::SvToken( SVTOKEN_ENUM nTypeP, const OString& rStr )
: nType( nTypeP ), aString( rStr ) {}
inline SvToken::SvToken( SVTOKEN_ENUM nTypeP )
: nType( nTypeP ) {}
class SvTokenStream
{
sal_uLong nLine, nColumn;
int nBufPos;
int c; // next character
sal_uInt16 nTabSize; // length of tabulator
OString aStrTrue;
OString aStrFalse;
sal_uLong nMaxPos;
SvFileStream * pInStream;
SvStream & rInStream;
OUString aFileName;
boost::ptr_vector<SvToken> aTokList;
boost::ptr_vector<SvToken>::iterator pCurToken;
OString aBufStr;
void InitCtor();
int GetNextChar();
int GetFastNextChar()
{
return (nBufPos < aBufStr.getLength())
? aBufStr[nBufPos++]
: '\0';
}
void FillTokenList();
sal_uLong GetNumber();
bool MakeToken( SvToken & );
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[n++] == '\t' ? nTabSize : 1;
}
}
public:
SvTokenStream( const OUString & rFileName );
SvTokenStream( SvStream & rInStream, const OUString & rFileName );
~SvTokenStream();
const OUString & GetFileName() const { return aFileName; }
SvStream & GetStream() { return rInStream; }
void SetTabSize( sal_uInt16 nTabSizeP )
{ nTabSize = nTabSizeP; }
sal_uInt16 GetTabSize() const { return nTabSize; }
SvToken* GetToken_PrevAll()
{
boost::ptr_vector<SvToken>::iterator pRetToken = pCurToken;
// current iterator always valid
if(pCurToken != aTokList.begin())
--pCurToken;
return &(*pRetToken);
}
SvToken* GetToken_NextAll()
{
boost::ptr_vector<SvToken>::iterator pRetToken = pCurToken++;
if (pCurToken == aTokList.end())
pCurToken = pRetToken;
SetMax();
return &(*pRetToken);
}
SvToken* GetToken_Next()
{
// comments get removed initially
return GetToken_NextAll();
}
SvToken& GetToken() const { return *pCurToken; }
bool Read( char cChar )
{
if( pCurToken->IsChar()
&& cChar == pCurToken->GetChar() )
{
GetToken_Next();
return true;
}
else
return false;
}
void ReadDelemiter()
{
if( pCurToken->IsChar()
&& (';' == pCurToken->GetChar()
|| ',' == pCurToken->GetChar()) )
{
GetToken_Next();
}
}
sal_uInt32 Tell() const { return pCurToken-aTokList.begin(); }
void Seek( sal_uInt32 nPos )
{
pCurToken = aTokList.begin() + nPos;
SetMax();
}
void SeekRel( sal_uInt32 nRelPos )
{
sal_uInt32 relIdx = Tell() + nRelPos;
if ( relIdx < aTokList.size())
{
pCurToken = aTokList.begin()+ (Tell() + nRelPos );
SetMax();
}
}
void SeekEnd()
{
pCurToken = aTokList.begin()+nMaxPos;
}
};
#endif // INCLUDED_IDL_INC_LEX_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|