Longest match isn't respect with literal strings (differs from zaach/jison)

I think I'm noticing jison being too greedy with lex grammars that contain string literals.

Here's a tiny grammar that allows you to and/or strings together, returning a binary tree.

/* lexical grammar */
%lex
%%

<<EOF>>          return 'EOF'
\s                       /* skip whitespace */
"and"                return 'AND'
"or"                   return 'OR'
[a-z]*                return 'WORD'

/lex

/* operator associations and precedence */

%left 'AND'
%left 'OR'

%start expressions

%% /* language grammar */

expressions
    : e EOF
        {return $1;}
    ;

e
    : e AND e
        {$$ = {type:"and", lft: $1, rgt:$3};}
    | e OR e
        {$$ = {type:"or", lft: $1, rgt:$3};}
    | WORD
        {$$ = $1}
    ;

When I try a query like paul and andre, I get a parser error (it tries to read the and... of andre as an AND node, rather than a WORD node.

However, when I use the same grammar in the original jison, it parses as expected.

GerHobbelt / jison

Longest match isn't respect with literal strings (differs from zaach/jison) #45