Searched refs:trans (Results 1 – 8 of 8) sorted by relevance
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/scripts/ |
D | markov.py | 7 self.trans = {} 10 self.trans.setdefault(state, []).append(next) 22 trans = self.trans 24 seq = choice(trans[None]) 27 options = trans[subseq] 92 if not m.trans: 98 for key in m.trans.keys(): 100 print repr(key), m.trans[key] 101 if histsize == 0: print repr(''), m.trans['']
|
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/dlg/ |
D | automata.c | 71 dfa_model_node->trans[i] = NIL_INDEX; 108 t->trans[j] = NIL_INDEX; 163 d_state->trans[a] = DFA_NO(trans_d_state); 273 *reach_list=NFA_NO(node->trans[0]); 308 if ((n=node->trans[0]) != NIL_INDEX && set_nil(node->label) && 314 if ((n=node->trans[1]) != NIL_INDEX && 317 set_orel(NFA_NO(node->trans[1]),b); 341 if ((n=node->trans[0]) != NIL_INDEX && set_nil(node->label) && 347 if ((n=node->trans[1]) != NIL_INDEX && 350 set_orel(NFA_NO(node->trans[1]),b);
|
D | dlg_p.c | 244 (t1)->trans[0]=zzaRet.l; in rule_list() 245 (t1)->trans[1]=zzaArg(zztasp2,1 ).l; in rule_list() 332 (t1)->trans[0]=zzaRet.l; in reg_expr() 333 (t1)->trans[1]=zzaArg(zztasp2,2 ).l; in reg_expr() 334 /* MR23 */ if (zzaRet.r != NULL) (zzaRet.r)->trans[1]=t2; in reg_expr() 336 (zzaArg(zztasp2,2 ).r)->trans[1]=t2; /* MR20 */ in reg_expr() 375 (zzaRet.r)->trans[1]=zzaArg(zztasp2,1 ).l; in and_expr() 413 /* MR23 */ if (zzaRet.r != NULL) (zzaRet.r)->trans[0] = zzaRet.l; in repeat_expr() 415 t1->trans[0]=zzaRet.l; in repeat_expr() 416 t1->trans[1]=t2; in repeat_expr() [all …]
|
D | dlg_p.g | 49 set used_chars; /* used to label trans. arcs */ 50 set used_classes; /* classes or chars used to label trans. arcs */ 210 (t1)->trans[0]=$$.l; 211 (t1)->trans[1]=$1.l; 238 (t1)->trans[0]=$$.l; 239 (t1)->trans[1]=$2.l; 240 /* MR23 */ if ($$.r != NULL) ($$.r)->trans[1]=t2; 242 ($2.r)->trans[1]=t2; /* MR20 */ 256 ($$.r)->trans[1]=$1.l; 266 /* MR23 */ if ($$.r != NULL) ($$.r)->trans[0] = $$.l; [all …]
|
D | output.c | 409 register int trans, items_on_line; local 422 trans = DFA(i)->trans[j]; 423 if (trans == NIL_INDEX) 424 trans = dfa_allocated+1; 426 fprintf(OUT, "%d", trans-1); 735 if (p->trans[0] != NIL_INDEX){ 736 printf("trans[0] => %d on ", NFA_NO(p->trans[0])); 742 if (p->trans[1] != NIL_INDEX) 744 NFA_NO(p->trans[1])); 780 s_p_nfa(p->trans[0]); [all …]
|
D | relabel.c | 173 r_intersect(start->trans[0],maximal_class); 174 r_intersect(start->trans[1],maximal_class); 214 label_node(start->trans[0]); 215 label_node(start->trans[1]);
|
D | dlg.h | 73 nfa_node *trans[2]; variable 85 int trans[1];/* size of transition table depends on variable
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
D | test_bigmem.py | 438 trans = string.maketrans('.aZ', '-!$') 443 s = s.translate(trans) 445 self.assertEqual(s[:sublen], SUBSTR.translate(trans)) 446 self.assertEqual(s[-sublen:], SUBSTR.translate(trans))
|