Developer Tools●●Solid
Go-Bt: Minimalist Behavior Trees for Go
Injected clock enables instant time-travel testing of timeout nodes without waiting.
Niche GemBig Brain
rvitorper
62122mo ago
Back to browse
GitHub Repository
A notation for writing trees and a parser for it
7 starsGo
Brashtag – A notation for writing trees and a parser for it
by pratikdeoghare·May 13, 2026·1 point·0 comments
AI Analysis
●MidCozyBig Brain
Another custom markup syntax competing with Markdown, Org-mode, and S-expression variants.
Strengths
- •Tick-based escaping mechanism allows embedding arbitrary code blocks without complex delimiters.
- •Parser assigns minimal semantic meaning, leaving interpretation entirely to downstream tools.
- •Includes reference implementations for flashcards, notebooks, and graph visualization.
Weaknesses
- •README explicitly lists missing tests, docs, and tutorials as current TODO items.
- •Solves the 'invent a syntax' problem but lacks a compelling reason to switch from Markdown.
Category
Target Audience
Developers interested in DSL design, markup languages, or personal knowledge management tools.
Similar To
Markdown · Org-mode · S-expressions
Post Description
Ideas:
* Keep the notation as small as possible and non-intrusive. * Have a parser that assigns as little meaning as possible and returns a tree that is easy to work with. * Do everything else by walking the tree. * Avoid having to come up with syntaxes and parsers all the time.
I think the design is complete because nothing can be taken away from the syntax or the parser.
I have been using this system for many years now. When I am writing brashtag documents I am think of constructing trees not of typing text.
Similar Projects
Developer Tools●●Solid
Diamond – an interactive CLI for editing trees
Fan-out tree pathing is clever; tree editors like FileZilla and VS Code already handle hierarchies.
Big BrainNiche Gem
justindmassey
403mo ago
Developer Tools●●●Banger
I ported Tree-sitter to Go
90x faster incremental parsing in pure Go—tree-sitter without C toolchain friction.
WizardryBig Brain
odvcencio
2221063mo ago
Developer Tools●●Solid
Nox – A tree-walking interpreted language written in pure Python
Pure Python interpreter with C FFI, but performance caps at Python speeds.
WizardryNiche Gem
DevNexe
103mo ago
Developer Tools●●Solid
I built a persistent LSM-Tree storage engine in Go from scratch
LSM-Tree from scratch in Go: WAL, SkipList, SSTables, compaction—education-grade.
WizardryBig BrainShip It
Jyotishmoy
103mo ago
AI/ML●●●Banger
Dendrite – O(1) KV cache forking for tree-structured LLM inference
O(1) fork latency makes tree search 1000x faster than vLLM for agentic workloads.
WizardryBig BrainZero to One
RyeCatcher
312mo ago