Expand description
§Ultra Heuristic Near-AST Parser v3
This version upgrades the parser from token-level heuristics to a structure-aware near-AST extractor.
§Core idea
Instead of parsing grammar, we reconstruct:
- scopes (brace trees)
- declarations (class/function/namespace)
- call sites
- qualified names
- structural blocks
§Design goals
- near‑AST accuracy without tree‑sitter
- robust C++/JS/Rust style class detection
- template / inheritance tolerant scanning
- O(n) linear pass
- zero unwrap / zero panic
Structs§
- Token 🔒
Enums§
Functions§
- build_
qualified 🔒 - build_
scope_ 🔒map - dedup 🔒
- extract_
calls 🔒 - extract_
namespaces 🔒 - extract_
structures 🔒 - find_
structural_ 🔒name - is_
class_ 🔒keyword - is_
function_ 🔒keyword - is_
modifier_ 🔒word - is_
noise_ 🔒word - is_
valid_ 🔒call - looks_
like_ 🔒markup - make_
node 🔒 - parse_
universal - Entry point for universal parsing.
- push 🔒
- skip_
template 🔒 - tokenize 🔒