Instructions on how to build and use the GLR parsing algorithm in C#

honey crisis <gaztoast@gmail.com>
Tue, 18 Feb 2020 17:27:10 -0800 (PST)

          From comp.compilers
Related articles
Instructions on how to build and use the GLR parsing algorithm in C# gaztoast@gmail.com (honey crisis) (2020-02-18)
| List of all articles for this month |
From: honey crisis <gaztoast@gmail.com>
Newsgroups: comp.compilers
Date: Tue, 18 Feb 2020 17:27:10 -0800 (PST)
Organization: Compilers Central
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="73688"; mail-complaints-to="abuse@iecc.com"
Keywords: parse, question
Posted-Date: 19 Feb 2020 11:21:43 EST

I've just released this at codeproject as an instructive guide on implementing
GLR via LALR(1) tables/workers


For those of you that don't know, GLR is the generalized version of LR parsing
and was designed to parse virtually anything parsable including fundamentally
ambiguous grammars, for which it returns multiple parse trees. It was
originally designed to do natural language parsing but it can be used to parse
highly ambiguous type-2+ languages like C#


https://www.codeproject.com/Articles/5259825/GLR-Parsing-in-Csharp-How-to-Use
-The-Most-Powerful


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.