Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #2452 > unrolled thread
| Started by | honey crisis <gaztoast@gmail.com> |
|---|---|
| First post | 2020-02-18 17:27 -0800 |
| Last post | 2020-02-18 17:27 -0800 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.compilers
Instructions on how to build and use the GLR parsing algorithm in C# honey crisis <gaztoast@gmail.com> - 2020-02-18 17:27 -0800
| From | honey crisis <gaztoast@gmail.com> |
|---|---|
| Date | 2020-02-18 17:27 -0800 |
| Subject | Instructions on how to build and use the GLR parsing algorithm in C# |
| Message-ID | <20-02-014@comp.compilers> |
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
Back to top | Article view | comp.compilers
csiph-web