The techniques underlying BiGrammar are similar to those described in the paper Invertible Syntax Descriptions: Unifying Parsing and Pretty Printing.

A BiGrammar may be defined in a left recursive fashion, which can be contributed to the use of packrat parsing with support for left-recursion. The work underlying this is described in the papers Packrat Parsing: Simple, Powerful, Lazy, Linear Time and Packrat Parsers Can Support Left Recursion.