Announcing The Grammar Forge Visual Grammar Development Environment

Quinn Tyler Jackson <quinn-j@shaw.ca>
17 Oct 2004 16:02:29 -0400

          From comp.compilers

Related articles
Re: Regular Expressions Martin.Ward@durham.ac.uk (Martin Ward) (2004-10-12)
Announcing The Grammar Forge Visual Grammar Development Environment quinn-j@shaw.ca (Quinn Tyler Jackson) (2004-10-17)
Re: Announcing The Grammar Forge Visual Grammar Development Environmen cfc@shell01.TheWorld.com (Chris F Clark) (2004-10-21)
| List of all articles for this month |
From: Quinn Tyler Jackson <quinn-j@shaw.ca>
Newsgroups: comp.compilers
Date: 17 Oct 2004 16:02:29 -0400
Organization: Compilers Central
References: 04-10-095
Keywords: lex, parse, available
Posted-Date: 17 Oct 2004 16:02:29 EDT

[This is a one time announcement. - qtj]


I am happy to announce the official public release of:


      The Grammar Forge v 5.0.0.1320


(Formerly known as the Meta-S Grammar Development Environment
and PAISLEI.)


You are cordially invited to visit the software's official
site at:


        http://members.shaw.ca/grammarforge/


The Grammar Forge is a visual grammar development environment
for Win32 systems with many unique development features,
including, but not limited to:


>>


* Adaptive grammar technology


Parse RNA pseudoknots, Perl, C++, and other context-sensitive
languages without writing a line of support code, in less than
cubic time. Parse anything that can be parsed.


* Integrated Lua support for reduction code


No longer do you have to leave the visual grammar development
environment to test grammars that rely on their reduction code
to effect correct parses. You can now single step through a
grammar's productions and right into associated reduction code,
all in one integrated environment.


* Grammar/parser profiler


Bottlenecks in your grammar? Where are they? Not sure if your
test case input thoroughly exercises all 200 productions of
your grammar? Interested in knowing how much time is spent going
down blind alleys in your grammar?


Answers to all of these questions are now a click away.


* Grammar reference graph


Ever wonder what the source of a recursive path in your grammar
is? Simply load the reference graph, click on Find Recusion,
and get your answer.


* Support for PowerBASIC


Load grammars in PowerBASIC and start parsing now. (C#, VB.NET,
and other .NET languages supported as well, through COM on Win32
systems, and Win32 C-calling-convention languages.)


* Coffee in the help system


The Grammar Forge is, indeed, the only visual parser generation
system that offers coffee in the help menu. Well, the only one
the author of the software knows of. This unique, ergonomic
feature, which is highly configurable and honors and remembers
user-specific preferences across IDE sessions, stands in a class
of its own.


>>


The C++ grammar classes that the Grammar Forge generates are
portable across C++ compilers that support a minimal subset of
C++. Since the same parsing engine that is included in the C++
source is compiled into the IDE, you are guaranteed that parsers
will behave in the field as they did during development.


Quinn Tyler Jackson
Grammar Forge Author


Post a followup to this message

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