0

我收到错误

    [fatal] rule statement has non-LL(*) decision due to recursive rule invocations reachable from alts 6,7. Resolve by left-factoring or using syntactic predicates or using backtrack=true option.  

我不确切知道我的语法的哪一部分引发了这个错误。和 1 个其他相同的错误,用于 alt 3,4

    parser grammar syn1;

    options {
      tokenVocab = lex1;
      buildAST=true;
    }


    program : 
         statements
         ;

    statements :
            statement ( SEMICOLON^ statement )*
        ;

    statement :
            variable ASSIGN^ exp
        |   SKIP
        |   IF^ boolexp THEN statement ELSE statement
        |   WHILE^ boolexp DO statement
        |   READ^ OPENPAREN! variable CLOSEPAREN! 
        |   WRITE^ OPENPAREN! exp CLOSEPAREN!
        |   WRITE^ OPENPAREN! boolexp CLOSEPAREN!
        |   WRITE^ OPENPAREN! STRING CLOSEPAREN!
        |   WRITELN
        |   OPENPAREN! statements CLOSEPAREN!
        ;

    boolexp : 
            boolterm ( AND^ boolterm )* 
        ;

    boolterm :
            NOT^ bool
        |   bool
        ;

    bool :
            TRUE
        |   FALSE
        |   exp EQUALS^ exp
        |   exp LESSEQUALS^ exp
        |   OPENPAREN! boolexp CLOSEPAREN!
        ;

    exp : 
            term (( ADD | SUBTRACT )^ term )*
        ;

    term :
            factor ( MULTIPLY^ factor ) *
        ;

    factor : 
            variable
        |   INTNUM
        |   OPENPAREN exp CLOSEPAREN
        ;

    variable :
            IDENTIFIERS
        ;

我不知道哪个部分需要重新排列以删除左递归,如果有人能指出这一点,我将不胜感激。

4

1 回答 1

0

问题似乎是这两种选择:

    |   WRITE^ OPENPAREN! exp CLOSEPAREN!
    |   WRITE^ OPENPAREN! boolexp CLOSEPAREN!

导致递归的示例输入(即我可以根据需要重复最后一部分,它仍然是这两个规则的有效前缀):

  • WRITE (((((((((((...
  • WRITE ( myVar + myVar + ...

在这两种情况下,在看到+-*、或ANDNOT)

于 2015-11-10T12:18:09.010 回答