Lines Matching refs:paren
0 // paren.h
59 Label paren_id; // ID of open (close) paren
60 StateId state_id; // destination (source) state of open (close) paren
75 return paren_id < this->paren.id ||
76 (p.paren_id == this->paren.id && p.state_id < this->state_id);
123 // Maps from state ID to reachable paren IDs from (to) that state.
126 // Maps from paren ID and state ID to reachable state set ID
130 // Maps from paren ID and state ID to arcs exiting that state with that
160 FSTERROR() << "PdtParenReachable: open paren info not implemented";
164 // Given a state ID, returns an iterator over paren IDs
171 // Given a paren ID and a state ID s, returns an iterator over
173 // have have close (open) parentheses matching the paren ID exiting
185 // Given a paren Id and a state ID s, return an iterator over
187 // parenthesis matching the paren ID.
195 // DFS that gathers paren and state set information.
207 const vector<pair<Label, Label> > &parens_; // Paren ID -> Labels
208 bool close_; // Close/open paren info?
209 unordered_map<Label, Label> paren_id_map_; // Paren labels -> ID
210 ParenMultiMap paren_multimap_; // Paren reachability
211 ParenArcMultiMap paren_arc_multimap_; // Paren Arcs
218 // DFS that gathers paren and state set information.
239 if (pit != paren_id_map_.end()) { // paren?
241 if (arc.ilabel == parens_[paren_id].first) { // open paren
254 } else { // non-paren
278 if (pit != paren_id_map_.end()) { // paren?
280 if (arc.ilabel == parens_[paren_id].first) { // open paren
292 } else { // close paren
298 } else { // non-paren
348 // Maps from open paren destination state to parenthesis ID.
351 // Maps from open paren state to source states of matching close parens
355 // Maps from open paren state to close source set ID
387 // Find close paren source states matching an open parenthesis.
403 // before Find(open_dest). Stores close paren source state sets
443 // paren and state
445 CloseSourceMap close_source_map_; // paren, state to set ID
