><br>
        <code>-H binary_search</code><br>
        <code>-H linear_search</code><br>
    <td>Generates alternatives to the default code generated on
    the skeleton side for operation dispatching (which uses perfect
    hashing). These options each give a small amount of footprint
    reducion, each amount slightly different, with a corresponding tradeoff
    in speed of operation dispatch.
</TABLE>

    <a name="runtime_footprint"></a>
    <h4>Run-time Footprint</h4>

<!-- Doug, put information about