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
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
|
/*
**************************************************************************
description
--------------------
copyright : (C) 2000-2003 by Andreas Zehender
email : [email protected]
**************************************************************************
**************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
**************************************************************************/
#include "pmparser.h"
#include <tqstring.h>
#include <tqbuffer.h>
#include <tdelocale.h>
#include "pmpart.h"
#include "pmdeclare.h"
#include "pmerrorflags.h"
#include "pmrecursiveobjectiterator.h"
#include "pmdebug.h"
unsigned int PMParser::s_maxErrors = 30;
unsigned int PMParser::s_maxWarnings = 50;
PMParser::PMParser( PMPart* part, TQIODevice* dev )
: m_okDeclares( 101 )
{
m_pPart = part;
m_pDevice = dev;
m_bDeviceCreated = false;
init( );
}
PMParser::PMParser( PMPart* part, const TQByteArray& array )
: m_okDeclares( 101 )
{
m_pPart = part;
TQBuffer* buffer = new TQBuffer( array );
buffer->open( IO_ReadOnly );
m_pDevice = buffer;
m_bDeviceCreated = true;
init( );
}
void PMParser::init( )
{
m_okDeclares.setAutoDelete( true );
m_pLocalST.setAutoDelete( true );
m_lineNum = -1;
m_pResultList = 0;
m_errors = 0;
m_warnings = 0;
m_bFatalError = false;
m_shownMessages = 0;
m_messages.clear( );
m_pTopParent = 0;
m_renamedObjectSymbols.clear( );
m_okDeclares.clear( );
m_pNextCheckDeclare = 0;
}
PMParser::~PMParser( )
{
if( m_bDeviceCreated )
delete m_pDevice;
}
void PMParser::printMessage( const PMPMessage messageNum )
{
if( !( m_shownMessages & messageNum ) )
{
m_shownMessages |= messageNum;
switch( messageNum )
{
case PMMClockDefault:
printWarning( i18n( "Using the default value of 0.0 for clock" ) );
break;
case PMMClockDeltaDefault:
printWarning( i18n( "Using the default value of 1.0 for clock_delta" ) );
break;
case PMMSpecialRawComment:
m_messages += PMMessage( i18n( "Note: The full povray syntax is not supported yet. "
"If you want to add unsupported povray code to the "
"scene, you can put this code between the two "
"special comments \"//*PMRawBegin\" and "
"\"//*PMRawEnd\"." ) );
break;
}
}
}
void PMParser::printMessage( const TQString& type, const TQString& msg )
{
if( m_lineNum >= 0 )
m_messages += PMMessage( i18n( "Line %1: " ).arg( m_lineNum ) + type + ": " + msg );
else
m_messages += PMMessage( type + ": " + msg );
}
void PMParser::printError( const TQString& msg )
{
if( m_errors < s_maxErrors )
{
printMessage( i18n( "Error" ), msg );
m_errors++;
}
else if( m_errors == s_maxErrors )
{
m_messages += PMMessage( i18n( "Maximum of %1 errors reached." )
.arg( s_maxErrors ) );
m_errors++;
}
}
void PMParser::printWarning( const TQString& msg )
{
if( m_warnings < s_maxWarnings )
{
printMessage( i18n( "Warning" ), msg );
m_warnings++;
}
else if( m_warnings == s_maxWarnings )
{
m_messages += PMMessage( i18n( "Maximum of %1 warnings reached." )
.arg( s_maxWarnings ) );
m_warnings++;
}
}
void PMParser::printExpected( const char c, const char* sValue )
{
printError( i18n( "'%1' expected, found token '%2' instead." )
.arg( c ).arg( sValue ) );
}
void PMParser::printExpected( const TQString& str, const char* sValue )
{
printError( i18n( "'%1' expected, found token '%2' instead." )
.arg( str ).arg( sValue ) );
}
void PMParser::printUnexpected( const TQString& str )
{
printError( i18n( "Unexpected token '%1'." ).arg( str ) );
}
void PMParser::printInfo( const TQString& msg )
{
printMessage( i18n( "Info" ), msg );
}
int PMParser::errorFlags( ) const
{
int result = 0;
if( errors( ) )
result |= PMEError;
if( warnings( ) )
result |= PMEWarning;
if( fatal( ) )
result |= PMEFatal;
return result;
}
void PMParser::parse( PMObjectList* list, PMObject* parent,
PMObject* after )
{
m_pResultList = list;
m_pTopParent = parent;
m_pAfter = after;
// find first item, that can be a declare and can be used as link
// for parsed objects.
if( parent )
{
if( parent->type( ) == "Scene" )
{
if( after )
m_pNextCheckDeclare = after;
else
m_pNextCheckDeclare = 0;
}
else
{
PMObject* obj = parent;
bool stop = false;
// go to parents, until the parent is the scene
// (declares can only be inserted as top level objects)
do
{
if( obj->parent( ) )
{
if( obj->parent( )->type( ) == "Scene" )
stop = true;
else
obj = obj->parent( );
}
else
{
obj = 0;
stop = true;
}
}
while( obj && !stop );
// now obj is the top level parent of the object, where parsed objects
// will be inserted
if( obj )
m_pNextCheckDeclare = obj->prevSibling( );
else
m_pNextCheckDeclare = 0;
}
}
topParse( );
TQPtrListIterator<PMSymbol> it( m_renamedObjectSymbols );
for( ; it.current( ); ++it )
it.current( )->setRenamedSymbol( 0 );
m_renamedObjectSymbols.clear( );
m_pLocalST.clear( );
if( ( errors( ) || warnings( ) ) && m_pResultList->isEmpty( ) )
setFatalError( );
}
bool PMParser::insertChild( PMObject* child, PMObject* parent )
{
bool inserted = false;
if( parent )
{
if( parent->canInsert( child, parent->lastChild( ) ) )
{
parent->appendChild( child );
inserted = true;
}
else
{
printError( i18n( "Can't insert %1 into %2." )
.arg( child->description( ) )
.arg( parent->description( ) ) );
}
}
else
{
if( m_pTopParent )
{
if( m_pTopParent->canInsert( child, m_pAfter, m_pResultList ) )
{
m_pResultList->append( child );
inserted = true;
}
else
{
printError( i18n( "Can't insert %1 into %2." )
.arg( child->description( ) )
.arg( m_pTopParent->description( ) ) );
}
}
else
{
// these lines should not be executed
// m_pTopParent may not be null
m_pResultList->append( child );
inserted = true;
}
}
if( !inserted )
{
// insert error
// remove all links
PMRecursiveObjectIterator rit( child );
PMDeclare* decl = 0;
for( ; rit.current( ); ++rit )
{
decl = rit.current( )->linkedObject( );
if( decl )
decl->removeLinkedObject( rit.current( ) );
}
}
return inserted;
}
void PMParser::checkID( PMDeclare* decl )
{
PMSymbolTable* st = m_pPart->symbolTable( );
PMSymbol* s = m_pLocalST.find( decl->id( ) );
if( !s )
s = st->find( decl->id( ) );
if( s )
{
PMSymbol* newSym = st->findNewID( s->id( ) + "_", decl );
s->setRenamedSymbol( newSym );
// Symbol can be inserted multiple times
// Faster than searching for s and inserting s
// if the list does not contain it.
m_renamedObjectSymbols.append( s );
if( m_pTopParent )
m_pLocalST.insert( decl->id( ), newSym ); // paste/drop
else
st->insert( decl->id( ), newSym ); // load file
}
else
{
s = new PMSymbol( decl->id( ), decl );
if( m_pTopParent )
m_pLocalST.insert( decl->id( ), s ); // paste/drop
else
st->insert( decl->id( ), s ); // load file
m_okDeclares.insert( decl->id( ), new bool( true ) );
}
}
void PMParser::checkID( const TQString& id, const PMValue& v )
{
PMSymbolTable* st = m_pPart->symbolTable( );
PMSymbol* s = m_pLocalST.find( id );
if( s )
{
PMSymbol* newSym = new PMSymbol( st->findNewID( id + "_" ), v );
s->setRenamedSymbol( newSym );
// Symbol can be inserted multiple times
// Faster than searching for s and inserting s
// if the list does not contain it.
m_renamedObjectSymbols.append( s );
if( m_pTopParent )
m_pLocalST.insert( id, newSym ); // paste/drop
// values are never inserted into the parts symbol table
// else
// st->insert( decl->id( ), newSym ); // load file
}
else
{
s = new PMSymbol( id, v );
if( m_pTopParent )
m_pLocalST.insert( id, s ); // paste/drop
// values are never inserted into the parts symbol table
// else
// st->insert( decl->id( ), s ); // load file
m_okDeclares.insert( id, new bool( true ) );
}
}
PMDeclare* PMParser::checkLink( const TQString& id )
{
PMSymbolTable* t = m_pPart->symbolTable( );
bool ok = false;
// is object declared?
PMSymbol* s = m_pLocalST.find( id );
if( !s )
s = t->find( id );
if( !s )
printError( i18n( "Undefined object \"%1\"." ).arg( id ) );
else if( s->type( ) != PMSymbol::Object )
printError( i18n( "Undefined object \"%1\"." ).arg( id ) );
else
{
// the object is declared
// is the id already in m_okDeclares
bool* lok = m_okDeclares.find( id );
if( lok )
ok = true;
else
{
// the id is not in m_okDeclares
PMObject* obj = s->object( );
while( m_pNextCheckDeclare && !ok )
{
if( m_pNextCheckDeclare->isA( "Declare" ) )
{
PMDeclare* decl = ( PMDeclare* ) m_pNextCheckDeclare;
m_okDeclares.insert( decl->id( ), new bool( true ) );
}
if( m_pNextCheckDeclare == obj )
ok = true;
m_pNextCheckDeclare = m_pNextCheckDeclare->prevSibling( );
}
}
if( !ok )
printError( i18n( "Object \"%1\" is undefined at that point." )
.arg( id ) );
}
if( ok )
{
while( s->renamedSymbol( ) )
s = s->renamedSymbol( );
return s->object( );
}
return 0;
}
PMSymbol* PMParser::getSymbol( const TQString& id ) const
{
PMSymbol* s = m_pLocalST.find( id );
if( !s )
s = m_pPart->symbolTable( )->find( id );
return s;
}
|