-
Thanks for your tutorial!
I am looking for an english grammar to do my text normalization tasks. But only a toy grammar provided by sparrowhawk toy demo.
And after one week search for grammar, I…
-
Except for the differentiation between _"fairly complete"_ and _"in development"_ grammars on the website (https://tree-sitter.github.io/tree-sitter/#available-parsers), I could not find any quality i…
-
Hi I want to check if the prevoius char is a `:`. The exact example code I have is this:
```
Prefix: !
```
I want basicly to be able to check based on if the previous char is a `:` the `!` sho…
-
hi @edmondchuc!
I'll add your implementation https://github.com/edmondchuc/shaclc/ to the list that we keep
- do you want to join the SHACLC 1.2 WG to work on standardization and extension of SHACLC…
-
Hi,
is there a way to test a guidance grammar without using a LLM call? I'm trying to write a complex grammar, and it is very cumbersome to develop it as LLM calls take their time. I would like to …
-
### Is there an existing issue for this?
- [X] I have searched the existing issues
### What is the missing lexer?
I would like to have a lexer for CSV (comma separated value) files:
https://en.wik…
-
- s -> effect transition makes no sense; use context-named convention consistently
- triv vs opand
- ambiguity between triv and loc in v2 language #18
-
FParsec (an F# parser combinator library) has the concept of "[user state](https://www.quanttec.com/fparsec/users-guide/parsing-with-user-state.html)", which can be used to maintain state between pars…
-
Serializing the grammar to XML, or to JSON would likely solve my problem. I will investigate per the links you provided.
A standard and portable form for these grammars would be nice, but is not re…
-
Unlike in LPeg, we'll have to deal with grammar sets. PEG has unified lexing/parsing, whereas typically Marpa will have at least a G1/L0 pair. (This is the same matter that I did not get right in my…