Hi Vinod,
After an initial glance at your paper, looping through the font pipeline
does look stupid. But I think this back and forth approach is easier to
implement in rendering engine, as opposed to dynamic generation of
processing pipeline, and that is why everybody is doing it. Three cheers, If
Indix did really achieve this. I was curios though, how much difference does
it make in terms of efficiency.
>>>The transformation rules in the Type 1 grammar are considered as a >>set
and not as a sequence
I did not fully understand this, but I am assuming you are against this.
Wouldn't type 1 grammar be used as a means to create the dynamic sequence
based on a context sensitive information, probably based on the best match
criteria and not ordering. But even with this, isn't there a mathematical
possibility of rule space growing very large in some hypothetical language,
thus hampering efficiency.
Sorry for sounding stupid (if)...
Thanks & regards
Naveen Kumar
------------------------------------------------------------------------------
BlackBerry® DevCon Americas, Oct. 18-20, San Francisco, CA
The must-attend event for mobile developers. Connect with experts.
Get tools for creating Super Apps. See the latest technologies.
Sessions, hands-on labs, demos & much more. Register early & save!
http://p.sf.net/sfu/rim-blackberry-1
_______________________________________________
IndLinux-group mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/indlinux-group