Skip to main content
 首页 » 编程设计

python之通过括号将 "Nested"字符串拆分为嵌套列表

2024年10月25日24think

我有一个树的字符串表示。我想将其转换为嵌套列表。有没有一种方法可以递归地执行此操作,以便我最终得到嵌套列表?

示例字符串如下所示:

(TOP (S (NP (PRP I)) (VP (VBP need) (NP (NP (DT a) (NN flight)) (PP 
(IN from) (NP (NNP Atlanta))) (PP (TO to) (NP (NP (NNP Charlotte)) (NP 
(NNP North) (NNP Carolina)))) (NP (JJ next) (NNP Monday)))))) 

到目前为止,我有以下内容,但它根本没有给我想要的东西。

import sys 
import re 
 
for tree_str in sys.stdin: 
    print [", ".join(x.split()) for x in re.split(r'[()]',tree_str) if x.strip()]  

请您参考如下方法:

我的方法是这样的:

import re 
 
 
def make_tree(data): 
    items = re.findall(r"\(|\)|\w+", data) 
 
    def req(index): 
        result = [] 
        item = items[index] 
        while item != ")": 
            if item == "(": 
                subtree, index = req(index + 1) 
                result.append(subtree) 
            else: 
                result.append(item) 
            index += 1 
            item = items[index] 
        return result, index 
 
    return req(1)[0] 
 
 
string = "(TOP (S (NP (PRP I))..." # omitted for readability 
tree = make_tree(string) 
 
print(tree) 
# Output: ['TOP', ['S', ['NP', ['PRP', 'I']]...