downloader
semantic-source
Our great sponsors
| downloader | semantic-source | |
|---|---|---|
| 0 | 22 | |
| 5 | 8,685 | |
| - | 0.5% | |
| 0.0 | 6.7 | |
| over 3 years ago | 11 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
downloader
We haven't tracked posts mentioning downloader yet.
Tracking mentions began in Dec 2020.
semantic-source
-
How to Get Started with Tree-Sitter
ah, easy. it's because support has not been added into https://github.com/github/semantic which is the tech that powers the GitHub UI. Adding support is pretty easy/mainly glue code [1] that imports the tree sitter API.
[1] https://github.com/github/semantic/blob/793a876ae45d38a6bd17...
I believe they use semantic (Haskell program that uses tree-sitter) for navigation: https://github.com/github/semantic
So the answer may be that semantic does not yet have support for the language in question.
- Scala community now has control over the official Scala grammar for tree-sitter 🎉
- 2022 State of Haskell Survey
-
11 Companies That Use Haskell in Production
GitHub used Haskell for implementing Semantic, a command-line tool for parsing, analyzing, and comparing source code.
-
What happened with GitHub's semantic project?
As far as engineering effort, you can read this GitHub comment for an overview of where we’d like to take the project in the future. The tl;dr here is that the open sum type view of the world made it very concise to fold over syntax trees (since such a view of data is ultimately unityped, recursion schemes Just Work), but the tradeoff thus associated—namely, that you have to parse a concrete syntax tree into an open-sum view (a complicated and painful-to-read process), that you can never really be sure how a given syntax tree is shaped, and that the types don’t help you nearly as much as they could—proved to be too onerous to deal with. Going forward, we’re generating syntax types from the AST once per target language, and working on an abstraction (probably via this generated code; I made five separate efforts at using Generics for this, and failed every time) that recovers at least some of the convenience of recursion schemes. It turns out that recursion schemes over a mutually recursive syntax tree—as pretty much every language’s syntax trees are, in practice—are pretty much an unsolved problem, especially when extended to languages like TypeScript, which have hundreds of different syntax nodes.
I'm just curious. It seems there hasn't been much activity in https://github.com/github/semantic Is GitHub still using semantic it to power some code navigation features? Has it been abandoned or is there some successor project that has taken its place? Is there any writeup / lessons learned about this project?
-
Stack Graphs
is this from Github semantic (https://github.com/github/semantic)?
Seems very suspicious since it’s the same goal using the same technologies. The latest commit is 4mo ago but i assume they have a closed-source version they’ve been working on.
Meanwhile their Tree-Sitter-based semantic parser[1] looks abandoned. There is even rotting for years pull request[2] adding support of the same stack graphs into it.
-
I just published an experimental `tree-sitter` grammar for Swift!
Does anyone here have experience with tree-sitter? If you aren't familiar, tree-sitter is a parser generator tool that builds parsers to use with an incremental parsing library. It's what's responsible for AST parsing on GitHub, for instance.
What are some alternatives?
diffsitter - A tree-sitter based AST difftool to get meaningful semantic diffs
massiv - Efficient Haskell Arrays featuring Parallel computation
Glean - System for collecting, deriving and working with facts about source code.
refined - Refinement types with static checking
cantor-pairing - Convert data to and from a natural number representation
jump - Jump start your Haskell development
months - Month, YearMonth, Quarter, YearQuarter
cregit
critbit - A Haskell implementation of crit-bit trees.
lens - Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
unordered-containers - Efficient hashing-based container types
milewski-ctfp-pdf - Bartosz Milewski's 'Category Theory for Programmers' unofficial PDF and LaTeX source