Comparing static and dynamic grammars.

For this very simple benchmark, comparing

A <~ 'a'* B*
B <- 'b'

For a static (standard Pegged) and a dynamic (rules are delegates constructed with peggged.dynamic.d) grammar
the results are astonishing: I get a dynamic parser 10 - 300 times faster than the static one.
Changing or() and getName. Trying templates.
Still comparing static and dynamic grammars.

I now have more reasonable results: they have the same speed, give or take 30%.