{"ast_node_type":"other","tokens":[{"end":76,"kind":"keyword","start":0,"text":"//!"}]}
//! (execution count) of each node is equal to the sum of its in-edge flows,
//! A control-flow graph can be said to have “balanced flow” if the flow
//! and also equal to the sum of its out-edge flows.