stick to ParsleyHaskell's optimizations, except on pattern-matching at the Haskell...

[haskell/symantic-parser.git] / test / Golden / Grammar / many-char-eof.opt.dump

<*>
+ <*>
| + pure (\u1 -> (\u2 -> u1 Term))
| ` def name_1
|   ` <|>
|     + <*>
|     | + <*>
|     | | + pure (\u1 -> (\u2 -> (\u3 -> 'r' : u2 u3)))
|     | | ` satisfy
|     | ` rec name_1
|     ` pure (\u1 -> u1)
` eof