From f9621483a0caeb49512bf4d15420bd05ea57cb22 Mon Sep 17 00:00:00 2001
From: bringert <bringert@cs.chalmers.se>
Date: Wed, 20 Dec 2006 20:10:15 +0000
Subject: Use LCLR algorithm for eliminating left-recursion, with lambda terms
 in SISR for getting trees right.

---
 src/GF/JavaScript/ParJS.y | 2 ++
 1 file changed, 2 insertions(+)

(limited to 'src/GF/JavaScript/ParJS.y')

diff --git a/src/GF/JavaScript/ParJS.y b/src/GF/JavaScript/ParJS.y
index 8f03fcd1c..b159d8790 100644
--- a/src/GF/JavaScript/ParJS.y
+++ b/src/GF/JavaScript/ParJS.y
@@ -122,6 +122,7 @@ Expr16 : Ident { EVar $1 }
   | 'null' { ENull }
   | 'this' { EThis }
   | 'function' '(' ListIdent ')' '{' ListStmt '}' { EFun $3 (reverse $6) }
+  | '(' Expr ',' ListExpr ')' { eseq1_ $2 $4 }
   | '(' Expr ')' { $2 }
 
 
@@ -201,5 +202,6 @@ happyError ts =
     _ -> " before " ++ unwords (map prToken (take 4 ts))
 
 myLexer = tokens
+eseq1_ x_ xs_ = ESeq (x_ : xs_)
 }
 
-- 
cgit v1.2.3