Answer architecture round 3: walk a table's row node in the cycle check, record where the read-once spelling meets an inline refusal, and cite goal 5.2 for a path tag drawing afresh

namefence.go

@@ -58,7 +58,9 @@ func rendersInside(nodes []node, t *template) bool {
 }
 
 // checkUses refuses a binding read once at a spot the bound spelling can stand: that spelling
-// draws the same way without the name. A field stands only beside its binding.
+// draws the same way without the name. A field stands only beside its binding. Where the spelling
+// would be a CLI argument or tag of one reference alone, that entry point's own refusal then
+// names the bare path.
 func (b *nameBinding) checkUses() error {
 	r := b.uses[0]
 	if len(b.uses) > 1 || r.nested || b.bindsField() && r.in != b.binder {