On Thu, Mar 18, 2010 at 4:10 AM, Aleksi Nurmi <[email protected]>wrote:
> This sounds a lot like what is described in "Parsing Mixfix Operators" > by Danielsson and Norell... Yes. That paper successfully obscures a simple idea with impenetrable notation. :-) > Anybody feel like taking the time to play around with one approach or the other to help move BitC forward? > What would you like to know about the first approach? I know nothing > about GLR parsing, so I think I'll pass that one. I'm thinking that if the entire problem reduces to resolving shift/reduce and reduce/reduce conflicts dynamically, then the user-supplied merge() function in GLR might be able to do the job. It may depend on whether merges are resolved top-down or bottom-up. I'm not sure.
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
