Python matchAgainst 예제들

예제 #1

 def matchOK(self, pat, exp, expected):
     subst = matchAgainst(pExp(pat), pExp(exp))
     if subst:
         subst_l = list(subst.iteritems())
         subst_l.sort()
         subst = "".join(["%s->%s;" % (vname, e) for (vname, e) in subst_l])
     self.assertEqual(expected, subst)

예제 #2

파일: algebra_tests.py 프로젝트: Johnicholas/spsc-lite-python

 def matchOK(self, pat, exp, expected):
     subst = matchAgainst(pExp(pat), pExp(exp))
     if subst:
         subst_l = list(subst.iteritems())
         subst_l.sort()
         subst = "".join(["%s->%s;" % (vname, e) 
                          for (vname, e) in subst_l])
     self.assertEqual(expected, subst)

예제 #3

파일: basic_process_tree_builder.py 프로젝트: Johnicholas/spsc-lite-python

 def loopBack(self, beta, alpha):
     subst = matchAgainst(alpha.exp, beta.exp)
     bindings = list(subst.items())
     bindings.sort()
     letExp = Let(alpha.exp, bindings)
     self.tree.replaceSubtree(beta, letExp)

예제 #4

파일: algebra_tests.py 프로젝트: Johnicholas/spsc-lite-python

 def matchNone(self, pat, exp):
     subst = matchAgainst(pExp(pat), pExp(exp))
     self.assertEqual(None, subst)

예제 #5

 def loopBack(self, beta, alpha):
     subst = matchAgainst(alpha.exp, beta.exp)
     bindings = list(subst.items())
     bindings.sort()
     letExp = Let(alpha.exp, bindings)
     self.tree.replaceSubtree(beta, letExp)

예제 #6

 def matchNone(self, pat, exp):
     subst = matchAgainst(pExp(pat), pExp(exp))
     self.assertEqual(None, subst)