Unless we missed something in the documentation, there are not many specifics on how to integrate our own lexor and parser. We are either considering a recursive descent parser or using CoCo which generates recursive descent parser which are fast. The language we have to bring over has some particularitis such as having reserved words while still having multi-word function names that can contain reserved words. This can all be sorted about in the grammar. We know that some of these interfaces between lexor/parser/AST may not have been completly fleshed out, but it would be nice to better know the more formal interface points back to the syntax editor. For example we would proceed right now on lexor/parser to create AST trees, while you guys finish up the editor, if we knew where the conflicts are. For example can we just use our own AST? est We don't want start down an incompatible path and then stuck with an expensive conversion later when the editor is done
Thank you, Bernie
Thank you, Bernie