in reply to Converting BNF for use in Parse::RecDescent
You can fix this by requiring that after matching the SQL statement, it should match the end of the string. But, for efficiency, also reorganize the rules:
although this is still inefficient, as it may require backtracking.condition: x /OR/i x | x x: y /AND/i y | y
Abigail
|
|---|