recursive-descent expression parsing

New API functions parse_fullexpr(), parse_listexpr(), parse_termexpr(),
and parse_arithexpr(), to parse an expression at various precedence
levels.

1 files changed, 10 insertions, 1 deletions

diff --git a/perly.y b/perly.y
index bf51922145..ab146274ed 100644
--- a/perly.y
+++ b/perly.y
@@ -69,7 +69,7 @@
 #endif
 }
 
-%token <ival> GRAMPROG GRAMBLOCK GRAMBARESTMT GRAMFULLSTMT GRAMSTMTSEQ
+%token <ival> GRAMPROG GRAMEXPR GRAMBLOCK GRAMBARESTMT GRAMFULLSTMT GRAMSTMTSEQ
 
 %token <i_tkval> '{' '}' '[' ']' '-' '+' '$' '@' '%' '*' '&' ';'
 
@@ -148,6 +148,15 @@ grammar	:	GRAMPROG
 			  newPROG(block_end($3,$4));
 			  $$ = 0;
 			}
+	|	GRAMEXPR
+			{
+			  parser->expect = XTERM;
+			}
+		listexprcom
+			{
+			  PL_eval_root = $3;
+			  $$ = 0;
+			}
 	|	GRAMBLOCK
 			{
 			  parser->expect = XBLOCK;