(defun fortran-beginning-do ()
"Search backwards for first unmatched DO [WHILE].
-Return point or nil. Ignores labelled DO loops (ie DO 10 ... 10 CONTINUE)."
+Return point or nil. Ignores labeled DO loops (ie DO 10 ... 10 CONTINUE)."
(let ((case-fold-search t)
(dostart-re "\\(\\(\\sw\\|\\s_\\)+:[ \t]*\\)?do[ \t]+[^0-9]"))
(if (save-excursion
(skip-chars-forward " \t0-9")
(cond ((looking-at dostart-re)
(setq count (1- count)))
- ;; Note labelled loop ends not considered.
+ ;; Note labeled loop ends not considered.
((looking-at "end[ \t]*do\\b")
(setq count (1+ count)))))
(and (zerop count)