intl/icu/source/common/rbbitblb.h@fc2d59ddac77
intl/icu/source/common/rbbitblb.h
Wed, 31 Dec 2014 07:22:50 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Wed, 31 Dec 2014 07:22:50 +0100
- branch
- TOR_BUG_3246
- changeset 4
- fc2d59ddac77
- permissions
- -rw-r--r--
Correct previous dual key logic pending first delivery installment.
1 //
2 // rbbitblb.h
3 //
5 /*
6 **********************************************************************
7 * Copyright (c) 2002-2005, International Business Machines
8 * Corporation and others. All Rights Reserved.
9 **********************************************************************
10 */
12 #ifndef RBBITBLB_H
13 #define RBBITBLB_H
15 #include "unicode/utypes.h"
16 #include "unicode/uobject.h"
17 #include "unicode/rbbi.h"
18 #include "rbbinode.h"
21 U_NAMESPACE_BEGIN
23 class RBBIRuleScanner;
24 class RBBIRuleBuilder;
26 //
27 // class RBBITableBuilder is part of the RBBI rule compiler.
28 // It builds the state transition table used by the RBBI runtime
29 // from the expression syntax tree generated by the rule scanner.
30 //
31 // This class is part of the RBBI implementation only.
32 // There is no user-visible public API here.
33 //
35 class RBBITableBuilder : public UMemory {
36 public:
37 RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode);
38 ~RBBITableBuilder();
40 void build();
41 int32_t getTableSize() const; // Return the runtime size in bytes of
42 // the built state table
43 void exportTable(void *where); // fill in the runtime state table.
44 // Sufficient memory must exist at
45 // the specified location.
48 private:
49 void calcNullable(RBBINode *n);
50 void calcFirstPos(RBBINode *n);
51 void calcLastPos(RBBINode *n);
52 void calcFollowPos(RBBINode *n);
53 void calcChainedFollowPos(RBBINode *n);
54 void bofFixup();
55 void buildStateTable();
56 void flagAcceptingStates();
57 void flagLookAheadStates();
58 void flagTaggedStates();
59 void mergeRuleStatusVals();
61 // Set functions for UVector.
62 // TODO: make a USet subclass of UVector
64 void setAdd(UVector *dest, UVector *source);
65 UBool setEquals(UVector *a, UVector *b);
67 void sortedAdd(UVector **dest, int32_t val);
69 public:
70 #ifdef RBBI_DEBUG
71 void printSet(UVector *s);
72 void printPosSets(RBBINode *n /* = NULL*/);
73 void printStates();
74 void printRuleStatusTable();
75 #else
76 #define printSet(s)
77 #define printPosSets(n)
78 #define printStates()
79 #define printRuleStatusTable()
80 #endif
82 private:
83 RBBIRuleBuilder *fRB;
84 RBBINode *&fTree; // The root node of the parse tree to build a
85 // table for.
86 UErrorCode *fStatus;
88 UVector *fDStates; // D states (Aho's terminology)
89 // Index is state number
90 // Contents are RBBIStateDescriptor pointers.
93 RBBITableBuilder(const RBBITableBuilder &other); // forbid copying of this class
94 RBBITableBuilder &operator=(const RBBITableBuilder &other); // forbid copying of this class
95 };
97 //
98 // RBBIStateDescriptor - The DFA is constructed as a set of these descriptors,
99 // one for each state.
100 class RBBIStateDescriptor : public UMemory {
101 public:
102 UBool fMarked;
103 int32_t fAccepting;
104 int32_t fLookAhead;
105 UVector *fTagVals;
106 int32_t fTagsIdx;
107 UVector *fPositions; // Set of parse tree positions associated
108 // with this state. Unordered (it's a set).
109 // UVector contents are RBBINode *
111 UVector *fDtran; // Transitions out of this state.
112 // indexed by input character
113 // contents is int index of dest state
114 // in RBBITableBuilder.fDStates
116 RBBIStateDescriptor(int maxInputSymbol, UErrorCode *fStatus);
117 ~RBBIStateDescriptor();
119 private:
120 RBBIStateDescriptor(const RBBIStateDescriptor &other); // forbid copying of this class
121 RBBIStateDescriptor &operator=(const RBBIStateDescriptor &other); // forbid copying of this class
122 };
126 U_NAMESPACE_END
127 #endif
