4 ms·
I only recently came across Semgrep and then after that, Comby (https://comby.dev/ https://comby.dev/). Has anyone compared the 2? They seem similar (structure
by dorian-graph 6y ago
I only recently came across Semgrep and then after that, Comby (https://comby.dev/ https://comby.dev/).
Has anyone compared the 2? They seem similar (structured find/replace, with registries of rules).
- rusbus 6y agoComby seems more like "parenthesis matching + search" (they don't implement a full parser for the language, just some basic required constructs to make a basic AST. I imagine this limits the resolution of the search? Semgrep uses an AST that's equivalent to the parser of the language itself so it's much higher resolution in terms of what you can match.
- dorian-graph 6y agoAh yeah, that is a strong distinction. Comby seems have a little nicer UX, but then as you've said, it would have a lower matching resolution. That explains why too that Comby supports so many languages so easily, and how easy it is to add your own DSL.
- carlmr 6y agoThank you. That's great, it seems like it can't parse a full AST, but works with other languages, like C++.