lib/ParserGenerator/PHP/ParserGenerator/Symbol.php
public static function sortSymbols($a, $b)
    {
        $i1 = $a->index + 10000000*(ord($a->name[0]) > ord('Z'));
        $i2 = $b->index + 10000000*(ord($b->name[0]) > ord('Z'));
        return $i1 - $i2;
    }
public static function sortSymbols($a, $b)
    {
        $i1 = $a->index + 10000000*(ord($a->name[0]) > ord('Z'));
        $i2 = $b->index + 10000000*(ord($b->name[0]) > ord('Z'));
        return $i1 - $i2;
    }
public static function sortSymbols ( $ a , $ b ) { $ i1 = $ a -> index + 10000000 * ( ord ( $ a -> name [ 0 ] ) > ord ( 'Z' ) ) ; $ i2 = $ b -> index + 10000000 * ( ord ( $ b -> name [ 0 ] ) > ord ( 'Z' ) ) ; return $ i1 - $ i2 ; }
Sort function helper for symbols

Symbols that begin with upper case letters (terminals or tokens)
must sort before symbols that begin with lower case letters
(non-terminals).  Other than that, the order does not matter.

We find experimentally that leaving the symbols in their original
order (the order they appeared in the grammar file) gives the
smallest parser tables in SQLite.
@param PHP_ParserGenerator_Symbol
@param PHP_ParserGenerator_Symbol
Sort function helper for symbols