In NetLogo programming language, there is a need to know if an identifier is a procedure/function to properly parse its grammar structure. While we have the list of all built-in ones, the problem is with user-defined ones: they could appear AFTER their first appearance. Therefore, I wonder if there is any natural way to deal with without hacking into Lezer and add a pre-parsing pass?
haha 1 2 3
to haha [ a b c ]
Thanks in advance!
Another question we have is if Lezer supports anything beyond
* like regular expressions. Like:
Which will only match 10 repeated arguments without the need to manually specify it. To make it better, is it possible to make 10 a parameter so that we don’t need to write 10 different rules for 10 different numbers?
No. This kind of thing is fundamentally at odds with incremental parsing, and is not something Lezer can help with.
Nope, since that is not a common thing to need in a grammar, Lezer has no provision for that.