|PAISLEI 2.0 beta testers sought firstname.lastname@example.org (Quinn Tyler Jackson) (1999-10-13)|
|From:||"Quinn Tyler Jackson" <email@example.com>|
|Date:||13 Oct 1999 00:58:22 -0400|
PAISLEI 2.0 will be going into beta soon, and I am seeking testers. I
have a pre-beta version available to anyone wishing to download the
pre-beta before committing to testing.
Screenshots of the next version can be found at:
PAISLEI is an experimental system that allows you to design adaptive
recursive descent predicate grammars using the LPM notation.
Once you have graphically designed and debugged your grammar in
PAISLEI and have convinced yourself that it is behaving on test data
as you wish it to, you can generate a potentially cross-platform
compatible C++ class (derived from the LPM class CLpmGrammar) which
will accept the same data as you tested in the IDE. Since the IDE
uses the CLpmGrammar class internally during debugging, your class
will behave identically and accept the same files.
The LPM language has several features which allow it to parse certain
"classic" difficult items in the grammar, rather than in the attached
code. The examples included with PAISLEI demonstrate this.
Version 2.0 introduces some new features in the IDE, as well as new
features in the LPM pattern matcher itself. The new LPM features
include, but are not limited to:
* relaxed permutation phrases
A loose subset of PP's as described by Dr. Rob Cameron.
* parse stack meta clauses
Patterns can fail if the stack is not in the expected state,
thereby allowing a mechanism for patterns to change behavior depending
on the stack state at invocation. (I'd sure love to get some pointers
to the literature on this feature...)
* anonymous caller pattern cast dereferencing
Patterns can refer to casts made by calling patterns without
knowing which pattern in particular called them.
Anyone interested in beta testing PAISLEI 2.0/LPM 3.0 should send
me an email at:
Quinn Tyler Jackson
Return to the
Search the comp.compilers archives again.