Normal & Compressed grammar!!

hi,

is there some technique or advice u can give me about the following... I
want to make a grammar(i still don't know what will be the grammar :")) that
will have two forms Normal (Human-readable) and Comppressed!!(speedier,
unreadable) ... i can figure out yet is this possible or how just thinking
!!!
The second grammar to be some sort of compiled-varinat of the first one.. be
executed faster, but in some way reuse code between the two...
Or if in the second variant I can omit the parsing phase it will be good..
May be I have to implement some sort of VM functionality and parser parse to
some intermediate representation which is then executed, so as a side effect
I can get&save this intermediate representatation.. But this will make the
task more complex...
Any ideas ..

Thanx in advance
=====
iVAN
[email protected]
=====