From dc3c009dca02052a8a1df700d22413efd9abcf01 Mon Sep 17 00:00:00 2001
From: night199uk <night199uk@hermitcrabslab.com>
Date: Mon, 19 Aug 2019 20:35:27 -0700
Subject: [PATCH] Tweak the Earley ambiguity algorithm to correctly prefer
 earlier branches

---
 lark/parsers/earley_forest.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lark/parsers/earley_forest.py b/lark/parsers/earley_forest.py
index 89522cd..bbceb42 100644
--- a/lark/parsers/earley_forest.py
+++ b/lark/parsers/earley_forest.py
@@ -122,7 +122,7 @@ class PackedNode(ForestNode):
         ambiguously. Hence, we use the sort order to identify
         the order in which ambiguous children should be considered.
         """
-        return self.is_empty, -self.priority, -self.rule.order
+        return self.is_empty, -self.priority, self.rule.order
 
     def __iter__(self):
         return iter([self.left, self.right])