Dear Dave and PowerBASIC tech staff:
        Over the last months I have been developing a pattern matching
        language known as ['LPM'$(tm).  The code had been debugged and
        certified and was running without error under PB 3.1.  A total
        of about $25,000 development time was put into this 5,000 source
        line utility.
        The code compiles under PB 3.2 without a hitch, but does not
        produce correct results when executed, and produces stack heap
        corrupt errors on every run, unless I remove an entire section
        of code.
        Since it compiles under 3.1, I suspect it SHOULD compile under
        3.2.  It compiles, but it doesn't run properly, and the error
        seems to be in PB 3.2's memory management, not in my code.
        Variables have unpredictable values at critical points in the
        code.  Running under 3.1 produces perfect results.
        I cannot go back to 3.1 for the sake of other aspects of the
        project that will benefit from the features found in 3.2, so how
        should I proceed, since it is unlikely that I can submit 5,000
        lines of state-of-the-art proprietary code to the PowerBASIC
        tech department for scrutiny.
        Please let me know how I should proceed.  If it comes down to
        it, I'm going to have to rewrite 5,000 lines of code at the cost
        of another $25,000 of my time.  And all for a $19.95 upgrade.
        
Jamshid
--- Maximus/2 2.01wb
---------------