+static int sp_expr(struct source_parser *sp, data1_node *n, RecWord *wrd);
+
+static int sp_range(struct source_parser *sp, data1_node *n, RecWord *wrd)
+{
+ int start, len;
+ RecWord tmp_w;
+
+ /* ( */
+ sp_lex(sp);
+ if (sp->lookahead != '(')
+ return 0;
+ sp_lex(sp); /* skip ( */
+
+ /* 1st arg: string */
+ if (!sp_expr(sp, n, wrd))
+ return 0;
+
+ if (sp->lookahead != ',')
+ return 0;
+ sp_lex(sp); /* skip , */
+
+ /* 2nd arg: start */
+ if (!sp_expr(sp, n, &tmp_w))
+ return 0;
+ start = atoi_n(tmp_w.term_buf, tmp_w.term_len);
+
+ if (sp->lookahead == ',')
+ {
+ sp_lex(sp); /* skip , */
+
+ /* 3rd arg: length */
+ if (!sp_expr(sp, n, &tmp_w))
+ return 0;
+ len = atoi_n(tmp_w.term_buf, tmp_w.term_len);
+ }
+ else
+ len = wrd->term_len;
+
+ /* ) */
+ if (sp->lookahead != ')')
+ return 0;
+ sp_lex(sp);
+
+ if (wrd->term_buf && wrd->term_len)
+ {
+ wrd->term_buf += start;
+ wrd->term_len -= start;
+ if (wrd->term_len > len)
+ wrd->term_len = len;
+ }
+ return 1;
+}
+
+static int sp_first(struct source_parser *sp, data1_node *n, RecWord *wrd)
+{
+ char num_str[20];
+ int min_pos = -1;
+ sp_lex(sp);
+ if (sp->lookahead != '(')
+ return 0;
+ sp_lex(sp); /* skip ( */
+ if (!sp_expr(sp, n, wrd))
+ return 0;
+ while (sp->lookahead == ',')
+ {
+ RecWord search_w;
+ int i;
+ sp_lex(sp); /* skip , */
+
+ if (!sp_expr(sp, n, &search_w))
+ return 0;
+ for (i = 0; i<wrd->term_len; i++)
+ {
+ int j;
+ for (j = 0; j<search_w.term_len && i+j < wrd->term_len; j++)
+ if (wrd->term_buf[i+j] != search_w.term_buf[j])
+ break;
+ if (j == search_w.term_len) /* match ? */
+ {
+ if (min_pos == -1 || i < min_pos)
+ min_pos = i;
+ break;
+ }
+ }
+ }
+ if (sp->lookahead != ')')
+ return 0;
+ sp_lex(sp);
+ if (min_pos == -1)
+ min_pos = 0; /* the default if not found */
+ sprintf(num_str, "%d", min_pos);
+ wrd->term_buf = nmem_strdup(sp->nmem, num_str);
+ wrd->term_len = strlen(wrd->term_buf);
+ return 1;
+}