Permalink
Reply- not abandoned years ago
- documentation and commented samples presenets
- CTFE the best
| Thread overview | ||||||
|---|---|---|---|---|---|---|
|
November 20, 2023 What parser generator can let me run arbitrary code in its match rules? | ||||
|---|---|---|---|---|
| ||||
 | ||||
November 20, 2023 Re: What parser generator can let me run arbitrary code in its match rules? | ||||
|---|---|---|---|---|
| ||||
Posted in reply to Dmitry Ponyatov | Or maybe someone advice me some set of books deeply targets for learning of binary and symmetric parsing (such as binpac), DCG in C or using generators in D, etc to let me write my own lib. Everething I found (besides the Dragon book) uses black magic with Haskell, Lisp etc. | |||
November 21, 2023 Re: What parser generator can let me run arbitrary code in its match rules? | ||||
|---|---|---|---|---|
| ||||
 Posted in reply to Dmitry Ponyatov | On Monday, 20 November 2023 at 23:56:36 UTC, Dmitry Ponyatov wrote: >Or maybe someone advice me some set of books deeply targets for learning of binary and symmetric parsing (such as binpac), DCG in C or using generators in D, etc to let me write my own lib. 'Crafting Interpreters' book explain recursive descent parser, including parsing binary operators with priorities. | |||
November 21, 2023 Re: What parser generator can let me run arbitrary code in its match rules? | ||||
|---|---|---|---|---|
| ||||
 Posted in reply to Dmitry Ponyatov | On Monday, 20 November 2023 at 23:50:24 UTC, Dmitry Ponyatov wrote: >
| |||
Copyright © 1999-2021 by the D Language Foundation