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
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
|
/*
Ousía
Copyright (C) 2014, 2015 Benjamin Paaßen, Andreas Stöckel
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 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _OUSIA_PARSER_SCOPE_HPP_
#define _OUSIA_PARSER_SCOPE_HPP_
#include <functional>
#include <list>
#include <unordered_set>
#include <vector>
#include <core/common/Logger.hpp>
#include <core/common/Rtti.hpp>
#include <core/common/Utils.hpp>
#include <core/model/Node.hpp>
/**
* @file ParserScope.hpp
*
* Contains the ParserScope class used for resolving references based on the
* current parser state.
*
* @author Andreas Stöckel (astoecke@techfak.uni-bielefeld.de)
*/
namespace ousia {
// Forward declaration
class CharReader;
class Logger;
class ParserScope;
class Type;
class Variant;
/**
* Callback function type used for creating a dummy object while no correct
* object is available for resolution.
*/
using ResolutionImposterCallback = std::function<Rooted<Node>()>;
/**
* Callback function type called whenever the result of a resolution is
* available.
*
* @param resolved is the new, resolved node.
* @param owner is the node that was passed as "owner".
* @param logger is the logger to which errors should be logged.
*/
using ResolutionResultCallback = std::function<
void(Handle<Node> resolved, Handle<Node> owner, Logger &logger)>;
/**
* Base class for the ParserScope, does not contain the mechanisms for deferred
* lookup, only maintains the stack of nodes.
*/
class ParserScopeBase {
protected:
/**
* List containing all nodes currently on the scope, with the newest nodes
* being pushed to the back of the list.
*/
NodeVector<Node> nodes;
public:
/**
* Default constructor, creates an empty ParserScope instance.
*/
ParserScopeBase();
/**
* Creates a new instance of the ParserScopeBase class, copying the the
*given
* nodes as initial start value of the node stack. This could for example
* be initialized with the path of a node.
*
* @param nodes is a node vector containing the current node stack.
*/
ParserScopeBase(const NodeVector<Node> &nodes);
/**
* Tries to resolve a node for the given type and path for all nodes that
* are currently in the stack, starting with the topmost node on the stack.
*
* @param type is the type of the node that should be resolved.
* @param path is the path for which a node should be resolved.
* @param logger is the logger instance into which resolution problems
* should be logged.
* @return a reference at a resolved node or nullptr if no node could be
* found.
*/
Rooted<Node> resolve(const Rtti &type, const std::vector<std::string> &path,
Logger &logger);
/**
* Returns true if the stack is empty.
*
* @return true if there is no element on the stack.
*/
bool isEmpty() const;
/**
* Returns a reference at the internal node stack.
*
* @return a const reference at the internal node stack.
*/
const NodeVector<Node> &getStack() const;
/**
* Returns a list containing the Rtti type of each Node that is currently
* in the stack.
*
* @return the type signature of the current node stack.
*/
std::vector<Rtti const *> getStackTypeSignature() const;
/**
* Returns the top-most Node instance in the ParserScopeBase hirarchy.
*
* @return a reference at the root node.
*/
Rooted<Node> getRoot() const;
/**
* Returns the bottom-most Node instance in the ParserScopeBase hirarchy,
* e.g. the node that was pushed last onto the stack.
*
* @return a reference at the leaf node.
*/
Rooted<Node> getLeaf() const;
/**
* Ascends in the stack starting with the leaf node, returns the first node
* that matches the type given in the RttiSet. Throws an exception if no
* node matches.
*
* @param types is a set of Rtti types for which should be searched in the
* stack.
* @param maxDepth is the maximum number of stack entries the selection
* function may ascend. A negative value indicates no limitation.
* @return the matching node.
*/
Rooted<Node> select(RttiSet types, int maxDepth = -1);
/**
* Ascends in the stack starting with the leaf node, returns the first node
* that matches the given type. Throws an exception if no node matches.
*
* @tparam T is the type that should be searched in the stack.
* @param maxDepth is the maximum number of stack entries the selection
* function may ascend. A negative value indicates no limitation.
* @return the matching node.
*/
template <class T>
Rooted<T> select(int maxDepth = -1)
{
return select(RttiSet{&typeOf<T>()}, maxDepth).cast<T>();
}
};
/**
* Class used for representing a deferred resolution. A deferred resolution is
* triggered whenever an object cannot be resolved, but there may be a chance
* that it can be resolved in the future. This happens e.g. if a document is
* just being parsed and the object that is being refered to has not been
* reached yet.
*/
class DeferredResolution {
private:
/**
* Copy of the scope at the time when the resolution was first triggered.
*/
ParserScopeBase scope;
/**
* Callback function to be called when an element is successfully resolved.
*/
ResolutionResultCallback resultCallback;
public:
/**
* Path queried for the resolution.
*/
std::vector<std::string> path;
/**
* Reference at the type of the object that should be resolved.
*/
const Rtti &type;
/**
* Node for which the resolution is taking place.
*/
Rooted<Node> owner;
/**
* Constructor of the DeferredResolutionScope class. Copies the given
* arguments.
*
* @param nodes is a reference at the current internal node stack of the
* ParserScope class.
* @param path is the path that was queried when the resolution failed the
* first time.
* @param type is the Rtti of the element that should be queried.
* @param resultCallback is the callback function that should be called if
* the desired element has indeed been found.
* @param owner is the node for which the resolution takes place.
*/
DeferredResolution(const NodeVector<Node> &nodes,
const std::vector<std::string> &path, const Rtti &type,
ResolutionResultCallback resultCallback,
Handle<Node> owner);
/**
* Performs the actual deferred resolution and calls the resultCallback
* callback function in case the resolution is sucessful. In this case
* returns true, false otherwise.
*
* @param ignore is a set of nodes that should be ignored if returned as
* resolution result as they are
* @param logger is the logger instance to which error messages should be
* logged.
* @return true if the resolution was successful, false otherwise.
*/
bool resolve(const std::unordered_multiset<const Node *> &ignore,
Logger &logger);
/**
* Inform the callee about the failure by calling the callback function with
* "nullptr" as resolved element.
*
* @param logger is the logger instance to which error messages should be
* logged.
*/
void fail(Logger &logger);
};
/**
* Enum containing all possible parser flags that can be used by parsers to
* signal states that cannot be (explicitly or implicitly) stored in the node
* graph itself.
*/
enum class ParserFlag {
/**
* Set to the boolean value "true" if the head section of a file has passed.
* This happens once the first non-import tag is reached.
*/
POST_HEAD
};
/**
* Provides an interface for document parsers to resolve references based on the
* current position in the created document tree. The ParserScope class itself
* is represented as a chain of ParserScope objects where each element has a
* reference to a Node object attached to it.
*/
class ParserScope : public ParserScopeBase {
public:
/**
* Struct describing a set parser flag.
*/
struct ParserFlagDescriptor {
/**
* Stack depth at which the flag has been set.
*/
size_t depth;
/**
* Flag that has been set.
*/
ParserFlag flag;
/**
* Value of that flag.
*/
bool value;
/**
* Default constructor.
*/
ParserFlagDescriptor() {}
/**
* Constructor of the parser flag descriptor class.
*
* @param depth is the depth at which the flag was set.
* @param flag is the flag that has been set.
* @param value is the value that has been set for that flag.
*/
ParserFlagDescriptor(size_t depth, ParserFlag flag, bool value)
: depth(depth), flag(flag), value(value)
{
}
};
private:
/**
* List containing all deferred resolution descriptors.
*/
std::list<DeferredResolution> deferred;
/**
* Multiset storing the Nodes that are currently awaiting resolution. This
* list has the purpose of forcing nodes to be resolved in the correct order
* -- first nodes need to be returned as resolution result, that do
* themselves not depend on other resolutions. However, if no further
* resolutions are possible, this rule is ignored and all resolutions are
* performed.
*/
std::unordered_multiset<const Node *> awaitingResolution;
/**
* Vector containing all set flags. The vector contains triples of the
* depth at which the flag was set, the flag itself and the value.
*/
std::vector<ParserFlagDescriptor> flags;
/**
* Depth of the "nodes" list when the ParserScope was created.
*/
size_t topLevelDepth;
/**
* List of a all nodes that have been pushed onto the scope at the top level
* depth.
*/
NodeVector<Node> topLevelNodes;
/**
* Private constructor used to create a ParserScope fork.
*/
ParserScope(const NodeVector<Node> &nodes,
const std::vector<ParserFlagDescriptor> &flags);
public:
/**
* Default constructor of the ParserScope class, creates an empty
* ParserScope with no element on the internal stack.
*/
ParserScope();
/**
* Makes sure all elements on the scope have been unwound. Loggs an error
* message if this is not the case and returns false.
*
* @param logger is the Logger instance to which information in case of
* failure should be written.
* @return true if the stack is unwound, false otherwise.
*/
bool checkUnwound(Logger &logger) const;
/**
* Returns a new ParserScope instance with a copy of the current node stack
* but empty deferred resolutions list and empty topLevelNodes.
*
* @return a forked ParserScope instance, which starts with a copy of the
* node stack.
*/
ParserScope fork();
/**
* Joins a previously forked ParserScope instance with this ParserScope.
* Copies all pending deferred resolutions from this ParserScope instance.
* Joining only works if the node stack of the given ParserScope has the
* same depth as the node stack of this ParserScope instance (has been
* unwound). This is assured by calling the "checkUnwound" function of
* the fork.
*
* @param fork is the ParserScope fork that should be joined with this
* ParserScope instance.
* @param logger is the Logger instance to which information in case of
* failure should be written.
* @return true if the operation was successful, false otherwise.
*/
bool join(const ParserScope &fork, Logger &logger);
/**
* Pushes a new node onto the scope.
*
* @param node is the node that should be used for local lookup.
*/
void push(Handle<Node> node);
/**
* Removes the last pushed node from the scope.
*/
void pop();
/**
* Returns the top-level nodes. These are the nodes that are pushed onto the
* scope instance while the node stack has the depth it had during the
* creation of this ParserScope instance.
*
* @return a node vector containing the top-level nodes.
*/
NodeVector<Node> getTopLevelNodes() const;
/**
* Sets a parser flag for the current stack depth.
*
* @param flag is the flag that should be set.
* @param value is the value to which the flag should be set.
*/
void setFlag(ParserFlag flag, bool value);
/**
* Gets the parser flag for the current stack depth, ascends the stack until
* a set for this flag is found. Returns false if the flag is not set.
*
* @param flag is the flag for which the value should be returned.
* @return the value that was previously set by setParserFlag or false if no
* value has been set.
*/
bool getFlag(ParserFlag flag);
/**
* Tries to resolve a node for the given type and path for all nodes
* currently on the stack, starting with the topmost node on the stack.
* Calls the "imposterCallback" function for obtaining a temporary
* result if a node cannot be resolved right now. The "resultCallback" is
* at most called twice: Once when this method is called (probably with the
* temporary) and another time if the resolution turned out to be
* successful at a later point in time.
*
* @param type is the type of the node that should be resolved.
* @param path is the path for which a node should be resolved.
* @param owner is the node for which the resolution takes place.
* @param logger is the logger instance into which resolution problems
* should be logged.
* @param imposterCallback is the callback function that is called if
* the node cannot be resolved at this moment. It gives the caller the
* possibility to create an imposter (a temporary object) that may be
* used later in the resolution process.
* @param resultCallback is the callback function to which the result of
* the resolution process is passed. This function is called at least
* once either with the imposter (if the resolution was not successful) or
* the resolved object directly when this function is called. If the
* resolution was not successful the first time, it may be called another
* time later in the context of the "performDeferredResolution" function.
* @return true if the resolution was immediately successful. This does
* not mean, that the resolved object does not exist, as it may be resolved
* later.
*/
bool resolve(const Rtti &type, const std::vector<std::string> &path,
Handle<Node> owner, Logger &logger,
ResolutionImposterCallback imposterCallback,
ResolutionResultCallback resultCallback);
/**
* Tries to resolve a node for the given type and path for all nodes
* currently on the stack, starting with the topmost node on the stack.
* The "resultCallback" is called when the resolution was successful, which
* may be at a later point in time.
*
* @param type is the type of the node that should be resolved.
* @param path is the path for which a node should be resolved.
* @param owner is the node for which the resolution takes place.
* @param logger is the logger instance into which resolution problems
* should be logged.
* @param resultCallback is the callback function to which the result of
* the resolution process is passed. This function is called once the
* resolution was successful.
* @return true if the resolution was immediately successful. This does not
* mean, that the resolved object does not exist, as it may be resolved
* later.
*/
bool resolve(const Rtti &type, const std::vector<std::string> &path,
Handle<Node> owner, Logger &logger,
ResolutionResultCallback resultCallback);
/**
* Tries to resolve a node for the given type and path for all nodes
* currently on the stack, starting with the topmost node on the stack.
* Calls the "imposterCallback" function for obtaining a temporary result if
* a node cannot be resolved right now. The "resultCallback" is at most
* called twice: Once when this method is called (probably with the
* temporary) and another time if the resolution turned out to because
* successful at a later point in time.
*
* @tparam T is the type of the node that should be resolved.
* @param path is the path for which a node should be resolved.
* @param owner is the node for which the resolution takes place.
* @param logger is the logger instance into which resolution problems
* should be logged.
* @param imposterCallback is the callback function that is called if
* the node cannot be resolved at this moment. It gives the caller the
* possibility to create an imposter (a temporary object) that may be used
* later in the resolution process.
* @param resultCallback is the callback function to which the result of
* the resolution process is passed. This function is called at least once
* either with the imposter (if the resolution was not successful) or the
* resolved object directly when this function is called. If the resolution
* was not successful the first time, it may be called another time later
* in the context of the "performDeferredResolution" function.
* @return true if the resolution was immediately successful. This does not
* mean, that the resolved object does not exist, as it may be resolved
* later.
*/
template <class T>
bool resolve(const std::vector<std::string> &path, Handle<Node> owner,
Logger &logger, ResolutionImposterCallback imposterCallback,
ResolutionResultCallback resultCallback)
{
return resolve(typeOf<T>(), path, owner, logger, imposterCallback,
resultCallback);
}
/**
* Tries to resolve a node for the given type and path for all nodes
* currently on the stack, starting with the topmost node on the stack.
* The "resultCallback" is called when the resolution was successful, which
* may be at a later point in time.
*
* @tparam T is the type of the node that should be resolved.
* @param path is the path for which a node should be resolved.
* @param owner is the node for which the resolution takes place.
* @param logger is the logger instance into which resolution problems
* should be logged.
* @param resultCallback is the callback function to which the result of
* the resolution process is passed. This function is called once the
* resolution was successful.
* @return true if the resolution was immediately successful. This does not
* mean, that the resolved object does not exist, as it may be resolved
* later.
*/
template <class T>
bool resolve(const std::vector<std::string> &path, Handle<Node> owner,
Logger &logger, ResolutionResultCallback resultCallback)
{
return resolve(typeOf<T>(), path, owner, logger, resultCallback);
}
/**
* Tries to resolve a node for the given type and path for all nodes
* currently on the stack, starting with the topmost node on the stack.
* Calls the "imposterCallback" function for obtaining a temporary result if
* a node cannot be resolved right now. The "resultCallback" is at most
* called twice: Once when this method is called (probably with the
* temporary) and another time if the resolution turned out to because
* successful at a later point in time.
*
* @tparam T is the type of the node that should be resolved.
* @param name is the path for which a node should be resolved. The name is
* split at '.' to form a path.
* @param owner is the node for which the resolution takes place.
* @param logger is the logger instance into which resolution problems
* should be logged.
* @param imposterCallback is the callback function that is called if
* the node cannot be resolved at this moment. It gives the caller the
* possibility to create an imposter (a temporary object) that may be used
* later in the resolution process.
* @param resultCallback is the callback function to which the result of
* the resolution process is passed. This function is called at least once
* either with the imposter (if the resolution was not successful) or the
* resolved object directly when this function is called. If the resolution
* was not successful the first time, it may be called another time later
* in the context of the "performDeferredResolution" function.
* @return true if the resolution was immediately successful. This does not
* mean, that the resolved object does not exist, as it may be resolved
* later.
*/
template <class T>
bool resolve(const std::string &name, Handle<Node> owner, Logger &logger,
ResolutionImposterCallback imposterCallback,
ResolutionResultCallback resultCallback)
{
return resolve<T>(Utils::split(name, '.'), owner, logger,
imposterCallback, resultCallback);
}
/**
* Tries to resolve a node for the given type and path for all nodes
* currently on the stack, starting with the topmost node on the stack.
* The "resultCallback" is called when the resolution was successful, which
* may be at a later point in time.
*
* @tparam T is the type of the node that should be resolved.
* @param name is the path for which a node should be resolved. The name is
* split at '.' to form a path.
* @param owner is the node for which the resolution takes place.
* @param logger is the logger instance into which resolution problems
* should be logged.
* @param resultCallback is the callback function to which the result of
* the resolution process is passed. This function is called once the
* resolution was successful.
* @return true if the resolution was immediately successful. This does not
* mean, that the resolved object does not exist, as it may be resolved
* later.
*/
template <class T>
bool resolve(const std::string &name, Handle<Node> owner, Logger &logger,
ResolutionResultCallback resultCallback)
{
return resolve<T>(Utils::split(name, '.'), owner, logger,
resultCallback);
}
/**
* Resolves a typesystem type. Makes sure an array type is returned if an
* array type is requested.
*
* @param path is the path for which a node should be resolved.
* @param owner is the node for which the resolution takes place.
* @param logger is the logger instance into which resolution problems
* should be logged.
* @param resultCallback is the callback function to which the result of
* the resolution process is passed. This function is called once the
* resolution was successful.
* @return true if the resolution was immediately successful. This does not
* mean, that the resolved object does not exist, as it may be resolved
* later.
*/
bool resolveType(const std::vector<std::string> &path, Handle<Node> owner,
Logger &logger, ResolutionResultCallback resultCallback);
/**
* Resolves a typesystem type. Makes sure an array type is returned if an
* array type is requested.
*
* @tparam T is the type of the node that should be resolved.
* @param name is the path for which a node should be resolved. The name is
* split at '.' to form a path.
* @param owner is the node for which the resolution takes place.
* @param logger is the logger instance into which resolution problems
* should be logged.
* @param resultCallback is the callback function to which the result of
* the resolution process is passed. This function is called once the
* resolution was successful.
* @return true if the resolution was immediately successful. This does not
* mean, that the resolved object does not exist, as it may be resolved
* later.
*/
bool resolveType(const std::string &name, Handle<Node> owner,
Logger &logger, ResolutionResultCallback resultCallback);
/**
* Build and resolves a (possibly) magic value with the given typesystem
* type. This function does not perform any deferred lookups.
*
* @param data is a reference at a variant that may contain magic values
* (even in inner structures). The data will be passed to the "build"
* function of the given type.
* @param type is the Typesystem type the data should be interpreted with.
* @param owner is the node for which the resolution takes place.
* @param logger is the logger instance into which resolution problems
* should be logged.
* @return true if the value was successfully built.
*/
bool resolveValue(Variant &data, Handle<Type> type, Handle<Node> owner,
Logger &logger);
/**
* Resolves a type and makes sure the corresponding value is of the correct
* type.
*
* @tparam T is the type of the node that should be resolved.
* @param path is the path for which a node should be resolved.
* @param owner is the node for which the resolution takes place.
* @param value is a reference at the Variant that represents the value for
* which the type should be looked up. The value must be valid as long as
* the owner node is valid (so it should be a part of the owner).
* @param logger is the logger instance into which resolution problems
* should be logged.
* @param resultCallback is the callback function to which the result of
* the resolution process is passed. This function is called once the
* resolution was successful.
* @return true if the resolution was immediately successful. This does not
* mean, that the resolved object does not exist, as it may be resolved
* later.
*/
bool resolveTypeWithValue(const std::vector<std::string> &path,
Handle<Node> owner, Variant &value,
Logger &logger,
ResolutionResultCallback resultCallback);
/**
* Resolves a type and makes sure the corresponding value is of the correct
* type.
*
* @tparam T is the type of the node that should be resolved.
* @param name is the path for which a node should be resolved. The name is
* split at '.' to form a path.
* @param owner is the node for which the resolution takes place.
* @param value is a reference at the Variant that represents the value for
* which the type should be looked up. The value must be valid as long as
* the owner node is valid (so it should be a part of the owner).
* @param logger is the logger instance into which resolution problems
* should be logged.
* @param resultCallback is the callback function to which the result of
* the resolution process is passed. This function is called once the
* resolution was successful.
* @return true if the resolution was immediately successful. This does not
* mean, that the resolved object does not exist, as it may be resolved
* later.
*/
bool resolveTypeWithValue(const std::string &name, Handle<Node> owner,
Variant &value, Logger &logger,
ResolutionResultCallback resultCallback);
/**
* Tries to resolve all currently deferred resolution steps. The list of
* pending deferred resolutions is cleared after this function has run.
*
* @param logger is the logger instance into which errors should be logged.
*/
bool performDeferredResolution(Logger &logger);
};
}
#endif /* _OUSIA_PARSER_SCOPE_HPP_ */
|