src/GrammarProperties.java
public boolean infinitelyAmbiguous() {
        for (String nt : cyclic)
            if (! unreachable.contains(nt) && ! unrealizable.contains(nt))
                return true;
        return false;
    }
/** Some strings have infinitely many derivations.
      This occurs if and only if a cyclic nonterminal is both reachable
      and realizable.
     */
Some strings have infinitely many derivations.
This occurs if and only if a cyclic nonterminal is both reachable
and realizable.
Some strings have infinitely many derivations . This occurs if and only if a cyclic nonterminal is both reachable and realizable .
public boolean infinitelyAmbiguous() {
        for (String nt : cyclic)
            if (! unreachable.contains(nt) && ! unrealizable.contains(nt))
                return true;
        return false;
    }
public boolean infinitelyAmbiguous ( ) { for ( String nt : cyclic ) if ( ! unreachable . contains ( nt ) && ! unrealizable . contains ( nt ) ) return true ; return false ; }
Some strings have infinitely many derivations.
Some strings have infinitely many derivations .