90f5ec5915
Adds pairs |
||
---|---|---|
.github | ||
.vscode | ||
data | ||
languages | ||
lsp-positions | ||
script | ||
stack-graphs | ||
tree-sitter-stack-graphs | ||
.gitignore | ||
.zenodo.json | ||
AUTHORS | ||
CODE_OF_CONDUCT.md | ||
CONTRIBUTING.md | ||
Cargo.toml | ||
LICENSE-APACHE | ||
LICENSE-MIT | ||
README.md | ||
SECURITY.md |
README.md
Stack graphs
The crates in this repository provide a Rust implementation of stack graphs, which allow you to define the name resolution rules for an arbitrary programming language in a way that is efficient, incremental, and does not need to tap into existing build or program analysis tools.
How to contribute
We welcome your contributions! Please see our contribution guidelines and our code of conduct for details on how to participate in our community.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as described below, without any additional terms or conditions.
Credits
Stack graphs are heavily based on the scope graphs framework from Eelco Visser's group at TU Delft.
License
Licensed under either of
at your option.