From 2d6c0ff87c705ba9d0de50e5eb9f8201c566f1d2 Mon Sep 17 00:00:00 2001
From: Zoltan Somogyi <zoltan.somogyi@runbox.com>
Date: Thu, 2 Apr 2026 23:22:02 +1100
Subject: [PATCH] Fix indentation.

---
 extras/lex/lex.m | 25 ++++++++++++-------------
 1 file changed, 12 insertions(+), 13 deletions(-)

diff --git a/extras/lex/lex.m b/extras/lex/lex.m
index 1f6673208..965af6077 100644
--- a/extras/lex/lex.m
+++ b/extras/lex/lex.m
@@ -87,7 +87,7 @@
 :- func *(T)      = regexp <= (regexp(T)).
 
     % One of the following two functions may be deprecated in future,
-    % depending upon whether there's a consensus concerning
+    % depending upon whether there is a consensus concerning
     % which is preferable. Both express alternation.
     %
 :- func  T1 \/ T2  = regexp <= (regexp(T1), regexp(T2)).
@@ -153,7 +153,7 @@
     %
 :- func charset(char_range) = charset.
 
-    % Creates a union of all char ranges in the list. Returns the empty set
+    % Create a union of all char ranges in the list. Return the empty set
     % if the list is empty. Any invalid codepoints are ignored.
     %
 :- func charset_from_ranges(list(char_range)) = charset.
@@ -181,23 +181,22 @@
 :- func (T1 -> token_creator(Tok)) = pair(regexp, token_creator(Tok))
     <= regexp(T1).
 
-    % Construct a lexer from which we can generate running
-    % instances.
+    % Construct a lexer from which we can generate running instances.
     %
-    % NOTE: If several lexemes match the same string only
-    % the token generated by the one closest to the start
-    % of the list of lexemes is returned.
+    % NOTE: If several lexemes match the same string, this returns only
+    % the token generated by the one closest to the start of the
+    % list of lexemes.
     %
 :- func init(list(lexeme(Tok))::in, read_pred(Src)::in(read_pred))
     = (lexer(Tok, Src)::out) is det.
 
-    % Construct a lexer from which we can generate running
-    % instances. If we construct a lexer with init/4, we
-    % can additionally ignore specific tokens.
+    % Construct a lexer from which we can generate running instances.
+    % If we construct a lexer with init/4, we can additionally ignore
+    % specific tokens.
     %
-    % NOTE: If several lexemes match the same string only
-    % the token generated by the one closest to the start
-    % of the list of lexemes is returned.
+    % NOTE: If several lexemes match the same string, this returns only
+    % the token generated by the one closest to the start of the
+    % list of lexemes.
     %
 :- func init(list(lexeme(Tok))::in, read_pred(Src)::in(read_pred),
     ignore_pred(Tok)::in(ignore_pred)) = (lexer(Tok, Src)::out) is det.