Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #2452
| From | honey crisis <gaztoast@gmail.com> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Instructions on how to build and use the GLR parsing algorithm in C# |
| Date | 2020-02-18 17:27 -0800 |
| Organization | Compilers Central |
| Message-ID | <20-02-014@comp.compilers> (permalink) |
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 comp.compilers | Previous | Next | Find similar
Instructions on how to build and use the GLR parsing algorithm in C# honey crisis <gaztoast@gmail.com> - 2020-02-18 17:27 -0800
csiph-web