[Announcement] PAISLEI 2.0/LPM 3.0 Now in Open Beta

[This is a one time announcement. -qtj.]


After one year of battle-testing, version 2.0 of PAISLEI, my freeware
grammar development/pattern matching system for Win32 systems is now
in open beta at:


        http://www.qtj.net/~lpm/beta/


At this point, all that remains to be done is to update/complete the
documentation and catch and fix the most obvious defects. User
feedback on which areas of the documentation need enhancement are
appreciated.


PAISLEI allows you to graphically design and debug predicated
recursive descent LL(k) grammars, and when you are satisfied that your
grammar is behaving properly against test files, to generate a
cross-platform compatible C++ class that represents your grammar.
Since PAISLEI uses the same classes and methods internally, your
grammars are guaranteed to accept the same languages as those you used
during grammar development.


New to version 2.0 are:


        * improved profiling
                - determine how many times each pattern of the grammar matches/fails
to match


        * more example grammars
                - palindrome grammar
                - parse the infamous "fruit flies like a banana/time flies like an
arrow" with no code required
                - several scanning grammars


        * new parsing features
                - permutation phrases (q.v. Robert Cameron)
                - more built-in macros
                - write scanning as well as accepting grammars


        * semantic error checking of grammars
                - catch left recursion, illegal lambda derivations, and other errors
during grammar compilation


        * sugar
                - color syntax highlighting in both pattern and C++ editors
                - casts now shown on the parse tree


--
Quinn Tyler Jackson
http://www.qtj.net/~quinn/

Return to the comp.compilers page.
Search the comp.compilers archives again.