由于BNF gramm，生成AST（抽象语法树）时出错

Question

所以，我有一个语法，它是：

    termo : PESQ termo termo PDIR

     | PESQ LAMBDA listav PONTO termo PDIR

     | VAR

    listav : VAR listav
      | VAR

其中termo=term，PESQ=（，PDIR=），LAMBDA=！，PONTO=，VAR=[a-z]，listav=变量列表

问题是，当我试图生成我输入的某个表达式的抽象语法树时，假设！x、 x，它给我一个错误：yacc:Syntax error at line 1，token=LAMBDA

我认为这里的问题是我定义语法的方式（以及将非终端插入堆栈数组）。我会把代码放在最下面。可能是关于堆栈的。append（p[x]）？我不太确定应该将哪些非终端附加到数组中，因为我有多个产品

import sys
from tree import *

stack = []

tokens = [

    'LAMBDA',
    'PONTO',
    'VAR',
    'PDIR',
    'PESQ'
]


t_LAMBDA = r'\!'
t_PONTO = r'\.'
t_VAR = r'[a-z]'
t_PDIR = r'\)'
t_PESQ = r'\('

t_ignore = r' '


def t_error(t):
    print("Illegal Character!")
    t.lexer.skip(1)

import ply.lex as lex
lexer = lex.lex()

def p_termo(p):
    '''
    termo : PESQ termo termo PDIR
          | PESQ LAMBDA listav PONTO termo PDIR
          | VAR
    '''

    if len(p) == 7:
        stack.append(p[2])
        stack.append(p[3])
        stack.append(p[4])
    elif len(p) == 2:
        stack.append(p[1])


def p_listav(p):
    '''
    listav : VAR listav
           | VAR
    '''

    if len(p) == 3:
        stack.append(p[1])
    elif len(p) == 2:
        stack.append(p[1])

import ply.yacc as yacc
parser = yacc.yacc()




while True:
    try:
        print('')
        print('Input: ')
        inp = input('')
    except EOFError:
        break
    stack = []
    p = parser.parse(inp)


    z = 0
    while z < len(stack):
        if z == 0:
            if len(stack) == 1:
                a = Tree(stack[z])
                z += 1
            elif stack[z+1] != '!':
                auxL = Tree(stack[z + 1])
                auxR = Tree(stack[z])
                a = Tree('@', auxL, auxR)
                z += 2
            else:
                a = Tree(stack[z])
                z += 1

        else:
            if stack[z] == '!' and stack[z-2] == '.' and z > 1:
                auxR = Tree(stack[z + 1])
                b = Tree('!', m, auxR)
                a = Tree('@', a, b)
                z += 3
            elif stack[z] == '!':
                auxL = Tree(stack[z+1])
                a = Tree('!', auxL, a)
                z += 3
            elif stack[z] != '!' and stack[z-1] == '.' and z != len(stack) - 1:
                if stack[z+1] == '!':
                    m = Tree(stack[z])
                    z += 1
                else:
                    auxR = Tree(stack[z])
                    a = Tree('@', a, auxR)
                    z += 1
            else:
                auxR = Tree(stack[z])
                a = Tree('@', a, auxR)
                z += 1



        arv = Tree.print_tree(a)
        print('###########################')
        print('Arvore: ')
        print(arv)
        print('###########################')