Searched refs:RBBINode (Results 1 – 24 of 24) sorted by relevance
43 Set<RBBINode> fPositions; // Set of parse tree positions associated54 fPositions = new HashSet<RBBINode>(); in RBBIStateDescriptor()118 RBBINode bofTop = new RBBINode(RBBINode.opCat); in build()119 RBBINode bofLeaf = new RBBINode(RBBINode.leafChar); in build()132 RBBINode cn = new RBBINode(RBBINode.opCat); in build()135 cn.fRightChild = new RBBINode(RBBINode.endMark); in build()205 void calcNullable(RBBINode n) { in calcNullable()209 if (n.fType == RBBINode.setRef || in calcNullable()210 n.fType == RBBINode.endMark ) { in calcNullable()216 if (n.fType == RBBINode.lookAhead || n.fType == RBBINode.tag) { in calcNullable()[all …]
18 class RBBINode { class67 RBBINode fParent;68 RBBINode fLeftChild;69 RBBINode fRightChild;94 Set<RBBINode> fFirstPosSet; // See Aho DFA table generation algorithm95 Set<RBBINode> fLastPosSet; // See Aho. 96 Set<RBBINode> fFollowPos; // See Aho.101 RBBINode(int t) { in RBBINode() method in RBBINode106 fFirstPosSet = new HashSet<RBBINode>(); in RBBINode()107 fLastPosSet = new HashSet<RBBINode>(); in RBBINode()[all …]
57 RBBINode fNodeStack[] = new RBBINode[kStackSize]; // Node stack, holds nodes created131 RBBINode n = null; in doParseActions()138 pushNewNode(RBBINode.opStart); in doParseActions()143 fixOpStack(RBBINode.precOpCat); in doParseActions()144 RBBINode operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()145 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions()158 fixOpStack(RBBINode.precOpCat); in doParseActions()159 RBBINode operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()160 RBBINode catNode = pushNewNode(RBBINode.opCat); in doParseActions()173 pushNewNode(RBBINode.opLParen); in doParseActions()[all …]
42 List<RBBINode> fIncludesSets; // vector of the the original48 fIncludesSets = new ArrayList<RBBINode>(); in RangeDescriptor()55 fIncludesSets = new ArrayList<RBBINode>(other.fIncludesSets); in RangeDescriptor()102 RBBINode usetNode = fIncludesSets.get(i); in setDictionaryFlag()104 RBBINode setRef = usetNode.fParent; in setDictionaryFlag()106 RBBINode varRef = setRef.fParent; in setDictionaryFlag()107 if (varRef != null && varRef.fType == RBBINode.varRef) { in setDictionaryFlag()170 for (RBBINode usetNode : fRB.fUSetNodes) { in build()265 for (RBBINode usetNode : fRB.fUSetNodes) { in build()367 void addValToSets(List<RBBINode> sets, int val) { in addValToSets()[all …]
30 RBBINode val;50 RBBINode varRefNode; in lookup()51 RBBINode exprNode; in lookup()53 RBBINode usetNode; in lookup()63 while (varRefNode.fLeftChild.fType == RBBINode.varRef) { in lookup()68 if (exprNode.fType == RBBINode.setRef) { in lookup()138 RBBINode lookupNode(String key) { in lookupNode()140 RBBINode retNode = null; in lookupNode()156 void addEntry(String key, RBBINode val) { in addEntry()
37 RBBINode[] fTreeRoots = new RBBINode[4];56 List<RBBINode> fUSetNodes; // Vector of all uset nodes.143 fUSetNodes = new ArrayList<RBBINode>(); in RBBIRuleBuilder()
44 Set<RBBINode> fPositions; // Set of parse tree positions associated55 fPositions = new HashSet<RBBINode>(); in RBBIStateDescriptor()119 RBBINode bofTop = new RBBINode(RBBINode.opCat); in build()120 RBBINode bofLeaf = new RBBINode(RBBINode.leafChar); in build()133 RBBINode cn = new RBBINode(RBBINode.opCat); in build()136 cn.fRightChild = new RBBINode(RBBINode.endMark); in build()206 void calcNullable(RBBINode n) { in calcNullable()210 if (n.fType == RBBINode.setRef || in calcNullable()211 n.fType == RBBINode.endMark ) { in calcNullable()217 if (n.fType == RBBINode.lookAhead || n.fType == RBBINode.tag) { in calcNullable()[all …]
19 class RBBINode { class68 RBBINode fParent;69 RBBINode fLeftChild;70 RBBINode fRightChild;95 Set<RBBINode> fFirstPosSet; // See Aho DFA table generation algorithm96 Set<RBBINode> fLastPosSet; // See Aho. 97 Set<RBBINode> fFollowPos; // See Aho.102 RBBINode(int t) { in RBBINode() method in RBBINode107 fFirstPosSet = new HashSet<RBBINode>(); in RBBINode()108 fLastPosSet = new HashSet<RBBINode>(); in RBBINode()[all …]
58 RBBINode fNodeStack[] = new RBBINode[kStackSize]; // Node stack, holds nodes created132 RBBINode n = null; in doParseActions()139 pushNewNode(RBBINode.opStart); in doParseActions()144 fixOpStack(RBBINode.precOpCat); in doParseActions()145 RBBINode operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()146 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions()159 fixOpStack(RBBINode.precOpCat); in doParseActions()160 RBBINode operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()161 RBBINode catNode = pushNewNode(RBBINode.opCat); in doParseActions()174 pushNewNode(RBBINode.opLParen); in doParseActions()[all …]
43 List<RBBINode> fIncludesSets; // vector of the the original49 fIncludesSets = new ArrayList<RBBINode>(); in RangeDescriptor()56 fIncludesSets = new ArrayList<RBBINode>(other.fIncludesSets); in RangeDescriptor()103 RBBINode usetNode = fIncludesSets.get(i); in setDictionaryFlag()105 RBBINode setRef = usetNode.fParent; in setDictionaryFlag()107 RBBINode varRef = setRef.fParent; in setDictionaryFlag()108 if (varRef != null && varRef.fType == RBBINode.varRef) { in setDictionaryFlag()171 for (RBBINode usetNode : fRB.fUSetNodes) { in build()266 for (RBBINode usetNode : fRB.fUSetNodes) { in build()368 void addValToSets(List<RBBINode> sets, int val) { in addValToSets()[all …]
31 RBBINode val;51 RBBINode varRefNode; in lookup()52 RBBINode exprNode; in lookup()54 RBBINode usetNode; in lookup()64 while (varRefNode.fLeftChild.fType == RBBINode.varRef) { in lookup()69 if (exprNode.fType == RBBINode.setRef) { in lookup()139 RBBINode lookupNode(String key) { in lookupNode()141 RBBINode retNode = null; in lookupNode()157 void addEntry(String key, RBBINode val) { in addEntry()
38 RBBINode[] fTreeRoots = new RBBINode[4];57 List<RBBINode> fUSetNodes; // Vector of all uset nodes.144 fUSetNodes = new ArrayList<RBBINode>(); in RBBIRuleBuilder()
46 RBBINode::RBBINode(NodeType t) : UMemory() { in RBBINode() function in RBBINode74 RBBINode::RBBINode(const RBBINode &other) : UMemory(other) { in RBBINode() function in RBBINode105 RBBINode::~RBBINode() { in ~RBBINode()141 RBBINode *RBBINode::cloneTree() { in cloneTree()142 RBBINode *n; in cloneTree()144 if (fType == RBBINode::varRef) { in cloneTree()148 } else if (fType == RBBINode::uset) { in cloneTree()151 n = new RBBINode(*this); in cloneTree()187 RBBINode *RBBINode::flattenVariables() { in flattenVariables()189 RBBINode *retNode = fLeftChild->cloneTree(); in flattenVariables()[all …]
27 RBBITableBuilder::RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode) : in RBBITableBuilder()93 RBBINode *bofTop = new RBBINode(RBBINode::opCat); in build()94 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar); in build()114 RBBINode *cn = new RBBINode(RBBINode::opCat); in build()122 cn->fRightChild = new RBBINode(RBBINode::endMark); in build()200 void RBBITableBuilder::calcNullable(RBBINode *n) { in calcNullable()204 if (n->fType == RBBINode::setRef || in calcNullable()205 n->fType == RBBINode::endMark ) { in calcNullable()211 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) { in calcNullable()225 if (n->fType == RBBINode::opOr) { in calcNullable()[all …]
25 class RBBINode : public UMemory {55 RBBINode *fParent;56 RBBINode *fLeftChild;57 RBBINode *fRightChild;87 RBBINode(NodeType t);88 RBBINode(const RBBINode &other);89 ~RBBINode();91 RBBINode *cloneTree();92 RBBINode *flattenVariables();94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);[all …]
196 RBBINode *n = NULL; in doParseActions()203 pushNewNode(RBBINode::opStart); in doParseActions()210 fixOpStack(RBBINode::precOpCat); in doParseActions()211 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()212 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions()227 fixOpStack(RBBINode::precOpCat); in doParseActions()228 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()229 RBBINode *catNode = pushNewNode(RBBINode::opCat); in doParseActions()244 pushNewNode(RBBINode::opLParen); in doParseActions()248 fixOpStack(RBBINode::precLParen); in doParseActions()[all …]
130 RBBINode *usetNode; in build()156 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in build()266 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in build()354 RBBINode *usetNode = (RBBINode *)sets->elementAt(ix); in addValToSets()359 void RBBISetBuilder::addValToSet(RBBINode *usetNode, uint32_t val) { in addValToSet()360 RBBINode *leafNode = new RBBINode(RBBINode::leafChar); in addValToSet()373 RBBINode *orNode = new RBBINode(RBBINode::opOr); in addValToSet()444 RBBINode *usetNode = (RBBINode *)rlRange->fIncludesSets->elementAt(i); in printRanges()446 RBBINode *setRef = usetNode->fParent; in printRanges()448 RBBINode *varRef = setRef->fParent; in printRanges()[all …]
32 class RBBINode; variable47 RBBINode *val;79 virtual RBBINode *lookupNode(const UnicodeString &key) const;80 virtual void addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &err);130 RBBINode *fForwardTree; // The parse trees, generated by the scanner,131 RBBINode *fReverseTree; // then manipulated by subsequent steps.132 RBBINode *fSafeFwdTree;133 RBBINode *fSafeRevTree;135 RBBINode **fDefaultTree; // For rules not qualified with a !186 RBBINode *val;
37 RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode);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);72 void printPosSets(RBBINode *n /* = NULL*/);84 RBBINode *&fTree; // The root node of the parse tree to build a
84 void fixOpStack(RBBINode::OpPrecedence p);86 void findSetFor(const UnicodeString &s, RBBINode *node, UnicodeSet *setToAdopt = NULL);92 RBBINode *pushNewNode(RBBINode::NodeType t);120 RBBINode *fNodeStack[kStackSize]; // Node stack, holds nodes created
73 RBBINode *varRefNode; in lookup()74 RBBINode *exprNode; in lookup()75 RBBINode *usetNode; in lookup()86 if (exprNode->fType == RBBINode::setRef) { in lookup()166 RBBINode *RBBISymbolTable::lookupNode(const UnicodeString &key) const{ in lookupNode()168 RBBINode *retNode = NULL; in lookupNode()185 void RBBISymbolTable::addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &er… in addEntry()
106 RBBINode *n = (RBBINode *)fUSetNodes->elementAt(i); in ~RBBIRuleBuilder()
83 void addValToSet (RBBINode *usetNode, uint32_t val);
META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF ...