Re: [ANN] an EBNF parser and coding pattern tool (LGPL)

[apm35@student.open.ac.uk (apm)]

codeworker@free.fr (Cedric LEMAIRE) wrote in message news:<clcm-20030128-> > [snip]
> > Does this mean it can be used to implement a program that can add and
> > remove Hungarian warts? This would enable programmers that don't speak
> > Hungarian to observe corporate standards but still work with
> > maintainable code.
> 
> Exactly. This program will be a script interpreted by 'CodeWorker', or
> be a C++ program generated from the script automatically.

This is excellent news.

> The way to do it is to use the 'source-to-source translation'
> functionality of the software (an parse tree isn't necessary to
> process the language-to-same-language transformation).
> 
> You must write the Extended BNF of the language you use (I don't
> propose EBNF for languages yet) and to redefine some clauses
> (identifier of a variable that is being declared, lambda-expression,
> method identifier) to apply/remove the Hungary Notation on it.

I was thinking of its application to C++. There is a well-known form
of "the Transylvanian Heresy" which most developers will have seen
from time to time. It includes things like 'b' for boolean, 'p' for
pointer, 'h' for handle, 'sz' for null terminated string, and so on.
Will there be default rules for this? This would allow people to work
with the most common form of 'the heresy'.

BTW I heard that the rules for parsing C++ have been expressed in BNF
and this *is* downloadable (sorry I don't have the URL).

-apm
-- 
comp.lang.c.moderated - moderation address: clcm@plethora.net