Polish

diff --git a/src/Symantic/Parser/Grammar/Optimize.hs b/src/Symantic/Parser/Grammar/Optimize.hs
index 87c1a4e089aabd0b7206c5795728b70d63534cb1..f9d6bb663f3bedd43ca60b06b949cc362178680a 100644 (file)
--- a/src/Symantic/Parser/Grammar/Optimize.hs
+++ b/src/Symantic/Parser/Grammar/Optimize.hs
@@ -127,7 +127,7 @@ instance Trans (OptimizeGrammar letName) Grammar where
 instance
   Letable letName Grammar =>
   Letable letName (OptimizeGrammar letName) where
-  -- Disable useless call to 'optimizeGrammarNode'
+  -- Disable useless calls to 'optimizeGrammarNode'
   -- where 'Def' or 'Ref' have no matching.
   def n = OptimizeGrammar . def n . unOptimizeGrammar
   ref r n = OptimizeGrammar (ref r n)
@@ -153,6 +153,9 @@ optimizeGrammarNode = \case
   -- Branch Weakening Law
   Branch b Empty Empty -> optimizeGrammarNode (b :*> Empty)
 
+  -- Pure merge optimisation
+  -- TODO: use trace to see why it's already handled by other laws
+  -- Pure x :<*> Pure y -> Pure (x Hask.:@ y)
   -- Applicable Identity Law
   Hask.Id :<$> x -> x
   -- Flip const optimisation
@@ -171,8 +174,6 @@ optimizeGrammarNode = \case
   Hask.Const :<$> p :<*> q -> p :<* q
   -- Reassociation Law 1
   (u :*> v) :<*> w -> optimizeGrammarNode (u :*> optimizeGrammarNode (v :<*> w))
-  -- Pure merge optimisation (useless)
-  -- Pure x :<*> Pure y -> Pure (x Hask.:@ y)
   -- Interchange Law
   u :<*> Pure x -> optimizeGrammarNode (Hask.Flip Hask.:@ (Hask.:$) Hask.:@ x :<$> u)
   -- Right Absorption Law