3 ms·
The way the D compiler does it is by parsing until it finds an error, marking the node as "poisoned" then walking back up until it can keep going. It seems to
by mhh__ 6y ago
The way the D compiler does it is by parsing until it finds an error, marking the node as "poisoned" then walking back up until it can keep going.
It seems to work although I would include a "fail early" flag just to help with enormous error messages (if you apply the principle to sema as well)