Uniformed messages removing final dot

Author: mapio

src/liblet/automaton.py

@@ -134,18 +134,18 @@ def __init__(self, N, T, transitions, q0, F):
     self.F = set(F)
     if self.N & self.T:
       raise ValueError(
-        f'The set of states and input symbols are not disjoint, but have {letstr(set(self.N & self.T))} in common.'
+        f'The set of states and input symbols are not disjoint, but have {letstr(set(self.N & self.T))} in common'
       )
     if self.q0 not in self.N:
-      raise ValueError(f'The specified q0 ({letstr(q0)}) is not a state.')
+      raise ValueError(f'The specified q0 ({letstr(q0)}) is not a state')
     if not self.F <= self.N:
-      raise ValueError(f'The accepting states {letstr(self.F - self.N)} in F are not states.')
+      raise ValueError(f'The accepting states {letstr(self.F - self.N)} in F are not states')
     bad_trans = tuple(
       t for t in transitions if t.frm not in self.N or t.to not in self.N or t.label not in (self.T | {ε})
     )
     if bad_trans:
       raise ValueError(
-        f'The following transitions contain states or symbols that are neither states nor input symbols: {bad_trans}.'
+        f'The following transitions contain states or symbols that are neither states nor input symbols: {bad_trans}'
       )
 
   def δ(self, X, x):
@@ -284,7 +284,7 @@ class TopDownInstantaneousDescription(InstantaneousDescription):
   def __init__(self, G, word=None):
     super().__init__(G)
     if HASH in (G.N | G.T):
-      raise ValueError('The ' + HASH + ' sign must not belong to terminal, or nonterminals.')
+      raise ValueError('The ' + HASH + ' sign must not belong to terminal, or nonterminals')
     if word is not None:
       self.tape = (*tuple(word), HASH)
       self.stack = Stack([HASH, G.S])
@@ -311,7 +311,7 @@ def match(self):
       if self.top() != ε:
         c.head_pos += 1
       return c
-    raise ValueError('The top of the stack and tape head symbol are not equal.')
+    raise ValueError('The top of the stack and tape head symbol are not equal')
 
   def predict(self, P):
     """Performs a prediction move, given the specified production.
@@ -334,7 +334,7 @@ def predict(self, P):
         for X in reversed(P.rhs):
           c.stack.push(X)
       return c
-    raise ValueError('The top of the stack does not correspond to the production lhs.')
+    raise ValueError('The top of the stack does not correspond to the production lhs')
 
 
 class BottomUpInstantaneousDescription(InstantaneousDescription):
@@ -376,7 +376,7 @@ def shift(self, consume=True):
         c.stack.push(Tree(c.head()))
         c.head_pos += 1
       else:
-        raise ValueError('The head is already at the end of the tape.')
+        raise ValueError('The head is already at the end of the tape')
     else:
       c.stack.push(Tree(ε))
     return c
@@ -392,13 +392,13 @@ def reduce(self, P):
       A new updated instantaneous description.
     """
     if P not in self.G.P:
-      raise ValueError('The production does not belong to the grammar.')
+      raise ValueError('The production does not belong to the grammar')
     if not self.stack:
-      raise ValueError('The stack is empty.')
+      raise ValueError('The stack is empty')
     c = copy(self)
     children = [c.stack.pop() for _ in P.rhs][::-1]
     if tuple(t.root for t in children) != P.rhs:
-      raise ValueError('The rhs does not correspond to the symbols on the stack.')
+      raise ValueError('The rhs does not correspond to the symbols on the stack')
     c.stack.push(Tree(P.lhs, children))
     c.steps = (P, *c.steps)
     return c

src/liblet/display.py

@@ -666,7 +666,7 @@ class Table:
 
   def __init__(self, ndim=1, element=lambda: None, no_reassign=False, fmt=None):
     if ndim not in {1, 2}:
-      raise ValueError('The ndim must be 1, or 2.')
+      raise ValueError('The ndim must be 1, or 2')
     self.ndim = ndim
     if ndim == 1:
       self.data = defaultdict(element)
@@ -801,7 +801,7 @@ def _repr_html_(self):
 
 def pyast2tree(node):
   """Deprecated. Use Tree.from_pyast instead."""
-  deprecation_warning('The function "pyast2tree" has been absorbed in Tree (as from_pyast factory method).')
+  deprecation_warning('The function "pyast2tree" has been absorbed in Tree (as from_pyast factory method)')
   return (
     Tree(
       {'type': 'ast', 'name': node.__class__.__name__},
@@ -893,7 +893,7 @@ def fmt(r, c):
 
 def cyk2table(TABLE):
   """Deprecated. Use CYKTable instead."""
-  deprecation_warning('The function "cyk2table" has been absorbed in CYKTable.')
+  deprecation_warning('The function "cyk2table" has been absorbed in CYKTable')
   t = CYKTable()
   for il, v in TABLE.items():
     t[il] = v
@@ -902,7 +902,7 @@ def cyk2table(TABLE):
 
 def prods2table(G):
   """Deprecated. Use Productions instead"""
-  deprecation_warning('The function "prods2table" has been absorbed in Productions.')
+  deprecation_warning('The function "prods2table" has been absorbed in Productions')
   return HTML(Productions(G.P)._repr_html_())
 
 

src/liblet/grammar.py

@@ -52,16 +52,16 @@ def __init__(self, lhs, rhs):
     elif isinstance(lhs, list | tuple) and lhs and all(isinstance(_, str) and _ for _ in lhs):
       self.lhs = tuple(lhs)
     else:
-      raise ValueError('The left-hand side is not a nonempty str, nor a tuple (or list) of nonempty str.')
+      raise ValueError('The left-hand side is not a nonempty str, nor a tuple (or list) of nonempty str')
     if isinstance(rhs, list | tuple):
       if not rhs:
         self.rhs = (ε,)
       elif all(isinstance(_, str) and _ for _ in rhs):
         self.rhs = tuple(rhs)
       else:
-        raise ValueError('The right-hand side is not an empty tuple (or list), or a tuple (or list) of nonempty str.')
+        raise ValueError('The right-hand side is not an empty tuple (or list), or a tuple (or list) of nonempty str')
     else:
-      raise ValueError('The right-hand side is not a tuple (or list).')  # noqa: TRY004
+      raise ValueError('The right-hand side is not a tuple (or list)')  # noqa: TRY004
     if ε in self.rhs and len(self.rhs) != 1:
       raise ValueError('The right-hand side contains ε but has more than one symbol')
 
@@ -91,7 +91,7 @@ def is_epsilon(self):
   @classmethod
   def from_string(cls, prods, context_free=True):  # pragma: no cover
     """Deprecated. Use Productions.from_string."""
-    deprecation_warning('The function "from_string" has been moved to Productions.')
+    deprecation_warning('The function "from_string" has been moved to Productions')
     return Productions.from_string(prods, context_free)
 
   @classmethod
@@ -244,9 +244,9 @@ class Item(Production):
 
   def __init__(self, lhs, rhs, pos=0):
     if not isinstance(lhs, str) and lhs:
-      raise ValueError('The left-hand side must be a str.')
+      raise ValueError('The left-hand side must be a str')
     if pos < 0 or pos > len(rhs):
-      raise ValueError('The dot position is invalid.')
+      raise ValueError('The dot position is invalid')
     self.pos = pos
     super().__init__(lhs, rhs)
 
@@ -318,11 +318,11 @@ def __init__(self, N, T, P, S):
         f'The set of terminals and nonterminals are not disjoint, but have {set(self.N & self.T)} in common.'
       )
     if self.S not in self.N:
-      raise ValueError('The start symbol is not a nonterminal.')
+      raise ValueError('The start symbol is not a nonterminal')
     if self.is_context_free:
       bad_prods = tuple(P for P in self.P if P.lhs not in self.N)
       if bad_prods:
-        raise ValueError(f'The following productions have a left-hand side that is not a nonterminal: {bad_prods}.')
+        raise ValueError(f'The following productions have a left-hand side that is not a nonterminal: {bad_prods}')
     bad_prods = tuple(P for P in self.P if not (set(P.as_type0().lhs) | set(P.rhs)).issubset(self.N | self.T | {ε}))
     if bad_prods:
       raise ValueError(
@@ -374,7 +374,7 @@ def from_string(cls, prods, context_free=True):
       T = symbols - N - {ε}
     G = cls(N, T, P, S)
     if context_free and not G.is_context_free:  # pragma: no cover
-      raise ValueError('The resulting grammar is not context-free, even if so requested.')
+      raise ValueError('The resulting grammar is not context-free, even if so requested')
     return G
 
   def alternatives(self, N):
@@ -404,7 +404,7 @@ def restrict_to(self, symbols):
       ValueError: in case the *start symbol* is not among the one to keep.
     """
     if self.S not in symbols:
-      raise ValueError('The start symbol must be present among the symbols to keep.')
+      raise ValueError('The start symbol must be present among the symbols to keep')
     return Grammar(self.N & symbols, self.T & symbols, (P for P in self.P if ({P.lhs} | set(P.rhs)) <= symbols), self.S)
 
 
@@ -551,7 +551,7 @@ def _step(derivation, prod, pos):
       prod = self.__ensure_prod_idx__(prod)
       P = derivation.G.P[prod].as_type0()
       if sf[pos : pos + len(P.lhs)] != P.lhs:
-        raise ValueError(f'Cannot apply {P} at position {pos} of {HAIR_SPACE.join(sf)}.')
+        raise ValueError(f'Cannot apply {P} at position {pos} of {HAIR_SPACE.join(sf)}')
       copy = Derivation(derivation.G, self.start)
       copy._sf = tuple(_ for _ in sf[:pos] + P.rhs + sf[pos + len(P.lhs) :] if _ != ε)
       copy._steps = (*derivation._steps, (prod, pos))

src/liblet/utils.py

@@ -23,13 +23,13 @@ def warn(msg):
 
 def first(s):
   """Deprecated. Use set.pop"""
-  deprecation_warning('The function "first" is now deprecated, please use "pop" instead.')
+  deprecation_warning('The function "first" is now deprecated, please use "pop" instead')
   return next(iter(s)) if s else None
 
 
 def peek(s):  # pragma: nocover
   """Deprecated. Use first"""
-  deprecation_warning('The function "peek" is now deprecated, please use "first" instead.')
+  deprecation_warning('The function "peek" is now deprecated, please use "first" instead')
   return first(s)
 
 
@@ -104,7 +104,7 @@ def dequeue(self):
     return self.Q.popleft()
 
   def copy(self):  # pragma: nocover
-    deprecation_warning('The copy method is deprecated, use the copy module.')
+    deprecation_warning('The copy method is deprecated, use the copy module')
     return self.__copy__()
 
   def __copy__(self):
@@ -179,7 +179,7 @@ def pop(self):
     return self.S.pop()
 
   def copy(self):  # pragma: nocover
-    deprecation_warning('The copy method is deprecated, use the copy module.')
+    deprecation_warning('The copy method is deprecated, use the copy module')
     return self.__copy__()
 
   def __copy__(self):