Steve Fan

This issue is spun-off from #96, where I was trying to "fork" the visitor so that we can implement a novel way to do clean semantic checking.  However, it seems...

How to make language specific AST?

1

I want to produce my own AST like this: ``` pub struct Expr { Atom(Identifier), Constant(Constant), Unary(Operator, Box), Binary(Box, Operator, Box), Declare(Type, Identifier, Option), } ``` What is the best...

Use Askama to render lexer and parser code templates

1

[Template syntax - Askama (djc.github.io)](https://djc.github.io/askama/template_syntax.html) Should look much better with a bunch of writeln macro. In C# world we have T4 templates but it seems like we are moving to...

Compression support is currently broken and should be marked as experimental

2

It seems like [clarify option names in CompilationTask and expose them in CLI ·](https://github.com/cenotelie/hime/commit/95d675ce63628f71342051c5e0cbf62c5e07ccfd) 95d675c [(github.com)](https://github.com/cenotelie/hime/commit/95d675ce63628f71342051c5e0cbf62c5e07ccfd) has broken the compression support. Currently I forked include-flate and added a bit of...

I want to know why are we descending into children first, shouldn't we visit the children after processing our current AST node first?

Tree felling for SPPF

1

For #96, we need to delete invalid tree in case if current node is illegal for now and obviously in the future (hence **felling a tree** -- We generate a...

How to print multiple ASTs for GLR parser correctly?

8

I'm trying to implement a C parser using hime based on the grammar here (https://www.quut.com/c/ANSI-C-grammar-y-2011.html) and here (https://www.quut.com/c/ANSI-C-grammar-l-2011.html), and for this particular input: ```c typedef char T; int main() {...

no-std support for Rust

5

I want to use this in a compiler project but the core part of the compiler, namely the parsing part is split out as `no_std` code and only specific loading...

[Rust] Automaton File Compression support

5

We can leverage [SOF3/include-flate: A variant of include\_bytes!/include\_str! with compile-time deflation and runtime lazy inflation (github.com)](https://github.com/SOF3/include-flate) for this.  From my preliminary test, the C# grammar can achieve more than 90%...

Operator precedence climbing parser

2

Consider what peg (https://docs.rs/peg/latest/peg/#precedence-climbing) was doing, I think it is suitable for us to implement [precedence climbing](https://en.wikipedia.org/wiki/Operator-precedence_parser#Precedence_climbing_method) for easier design of expression grammar