Y
Hacker News
new
|
ask
|
show
|
jobs
by
megous
2278 days ago
For representing a graph of processing nodes, none of these are great. Maybe something like DTS format used by the Linux kernel, where the language parser itself would be able to check connections between processing nodes.
1 comments
ape4
2277 days ago
It took some looking but I think DTS=Device Tree Spec.
https://elinux.org/Device_Tree_Usage
link