Nyl*_*ius 1 python recursion logic json polish-notation
我有这个功能:
def req_splitter(req_string):
req = {}
if " AND " in req_string:
cond = "AND"
req_splitted = req_string.split(" AND ")
elif " OR " in req_string:
cond = "OR"
req_splitted = req_string.split(" OR ")
else:
cond = "AND"
req_splitted = [req_string]
if len(req_splitted) > 1:
for sub_req in req_splitted:
sub_req_splitted = req_splitter(sub_req)
req[cond] = list()#new_req
req[cond].append(sub_req_splitted)
else:
req[cond] = req_splitted
return req
Run Code Online (Sandbox Code Playgroud)
它旨在将像这样的字符串转换为json逻辑条件:
Barracks AND Tech Lab
Lair OR Hive
Hatchery OR Lair OR Hive
Cybernetics Core AND Gateway OR Warpgate
Forge AND Twilight Council AND Ground Armor 1
Spire OR Greater Spire AND Hive AND Flyer Flyer Carapace 2
Spire OR Greater Spire AND Lair OR Hive AND Flyer Attacks 1
Run Code Online (Sandbox Code Playgroud)
json_logic条件如下所示:
{
"and": [
{
"or": [
"Gateway",
"Warpgate"
]
},
"Cybernetics Core"
]
}
Run Code Online (Sandbox Code Playgroud)
我的递归函数应该如何帮助我将字符串拆分为条件对象,如上例所示?
为了帮助您了解问题:
json_logic是一个检查条件的模块,就像你上面看到的字典一样,并返回一些结果,具体取决于你比较的内容.
条件如何工作:键值par是一个单一的逻辑语句.关键代表逻辑条件.列表中的值代表操作数.如果一个值本身不是一个列表而是一个字典,它会递归.
你可以将它与" 波兰记谱法 " 进行比较
最后一点 - AND语句比OR语句具有更高的优先级,OR语句总是在一起.
您需要编写一个简单的自上而下的解析器.无与伦比的effbot写了一篇关于这种事情的精彩教程.
令牌化只是分裂r'\s+(OR|AND)\s+'正则表达式,然后识别OR和AND作为运算符,其余的作为文字.在AND和OR标记.led()方法可以拉平同类型的直接嵌套运营商.
我已经使用更多的OOP(而不是全局变量)实现了那里描述的内容,并使Python 2和3兼容:
import re
from functools import partial
class OpAndToken(object):
lbp = 10
op = 'and'
def led(self, parser, left):
right = parser.expression(self.lbp)
operands = []
for operand in left, right:
# flatten out nested operands of the same type
if isinstance(operand, dict) and self.op in operand:
operands.extend(operand[self.op])
else:
operands.append(operand)
return {self.op: operands}
class OpOrToken(OpAndToken):
lbp = 20
op = 'or'
class LiteralToken(object):
def __init__(self, value):
self.value = value
def nud(self):
return self.value
class EndToken(object):
lbp = 0
class Parser(object):
operators = {'AND': OpAndToken, 'OR': OpOrToken}
token_pat = re.compile("\s+(AND|OR)\s+")
def __init__(self, program):
self.program = program
self.tokens = self.tokenizer()
self.token = next(self.tokens)
def expression(self, rbp=0):
t = self.token
self.token = next(self.tokens)
left = t.nud()
while rbp < self.token.lbp:
t = self.token
self.token = next(self.tokens)
left = t.led(self, left)
return left
def tokenizer(self):
for tok in self.token_pat.split(self.program):
if tok in self.operators:
yield self.operators[tok]()
else:
yield LiteralToken(tok)
yield EndToken()
def parse(self):
return self.expression()
Run Code Online (Sandbox Code Playgroud)
这会将您的格式解析为预期的输出:
>>> Parser('foo AND bar OR spam AND eggs').parse()
{'and': ['foo', {'or': ['bar', 'spam']}, 'eggs']}
Run Code Online (Sandbox Code Playgroud)
在输入行上演示:
>>> from pprint import pprint
>>> tests = '''\
... Barracks AND Tech Lab
... Lair OR Hive
... Hatchery OR Lair OR Hive
... Cybernetics Core AND Gateway OR Warpgate
... Forge AND Twilight Council AND Ground Armor 1
... Spire OR Greater Spire AND Hive AND Flyer Flyer Carapace 2
... Spire OR Greater Spire AND Lair OR Hive AND Flyer Attacks 1
... '''.splitlines()
>>> for test in tests:
... pprint(Parser(test).parse())
...
{'and': ['Barracks', 'Tech Lab']}
{'or': ['Lair', 'Hive']}
{'or': ['Hatchery', 'Lair', 'Hive']}
{'and': ['Cybernetics Core', {'or': ['Gateway', 'Warpgate']}]}
{'and': ['Forge', 'Twilight Council', 'Ground Armor 1']}
{'and': [{'or': ['Spire', 'Greater Spire']}, 'Hive', 'Flyer Flyer Carapace 2']}
{'and': [{'or': ['Spire', 'Greater Spire']},
{'or': ['Lair', 'Hive']},
'Flyer Attacks 1']}
Run Code Online (Sandbox Code Playgroud)
请注意,对于行中的多个OR或AND运算符,将组合操作数.
我会给(...)读者增加对括号的支持; 本教程将向您展示如何执行此操作(只需将该advance()函数设置为Parser类上的方法并将解析器传递给.nud()调用,或者在创建令牌类实例时传入解析器).
| 归档时间: |
|
| 查看次数: |
552 次 |
| 最近记录: |