reverofevil

Oh, I almost got it. Did you mean that adding `match` imposes an additional overhead, and you'd prefer to add it only on opt-in basis as a flag to `compile`?...

Unfortunately that grammar also parses `\uD83D\uD83D`.

Just avoid choices that start with a common sequence. There are implementation of PEGs that need explicit backtracking annotations (`try` in Parsec, for example) to enforce this rule. It's not...

I think it would be easier if Joe just became the next maintainer of this repo. There's way too much infrastructure to fix. @futagoza @dmajda

There are two types of arguments that could be passed to parsers: 1. Values. Grammars for languages like Python, Nim and Haskell (and also Scheme in a different way) depend...

BTW, this only shows this feature should have never been there. I'd remove that option in a major version. If user of the library wants to evaluate it immediately, it's...

@futagoza Isn't that a regression? I might have forgotten, but I remember PEG.js metagrammar included whole ES5 grammar at one time for the purpose of proper brace balancing. In any...

I should learn to read the thread first. Probably it was mine fork of PEG.js, based on solution by bd82. That's an easy and viable approach.

Could you please set the branch with ranges as base to this PR, so that it shows only the relevant diff?

Luckily we're programming in JS, where you can have an array that is also an object. ```typescript // rule = a:number b:number const a = [1, 2]; Object.assign(a, {a: 1,...