Sophie

Sophie

distrib > Fedora > 15 > i386 > by-pkgid > 7ebd25ac536d248d499a3ce2acda963a > files > 5544

Macaulay2-1.3.1-8.fc15.i686.rpm

<?xml version="1.0" encoding="utf-8" ?>  <!-- for emacs: -*- coding: utf-8 -*- -->
<!-- Apache may like this line in the file .htaccess: AddCharset utf-8 .html -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN"	 "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg-flat.dtd" >
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head><title>+ Parser -- repetition of a parser at least once</title>
<link rel="stylesheet" type="text/css" href="../../../../Macaulay2/Style/doc.css"/>
</head>
<body>
<table class="buttons">
  <tr>
    <td><div><a href="___Function_sp_pc_sp__Parser.html">next</a> | <a href="__st_sp__Parser.html">previous</a> | <a href="___Function_sp_pc_sp__Parser.html">forward</a> | <a href="__st_sp__Parser.html">backward</a> | <a href="___Parser.html">up</a> | <a href="index.html">top</a> | <a href="master.html">index</a> | <a href="toc.html">toc</a> | <a href="http://www.math.uiuc.edu/Macaulay2/">Macaulay2 web site</a></div>

    </td>
  </tr>
</table>
<div><a href="index.html" title="a framework for building parsers">Parsing</a> > <a href="___Parser.html" title="the class of all parsers">Parser</a> > <a href="__pl_sp__Parser.html" title="repetition of a parser at least once">+ Parser</a></div>
<hr/>
<div><h1>+ Parser -- repetition of a parser at least once</h1>
<div class="single"><h2>Synopsis</h2>
<ul><li><div class="list"><dl class="element"><dt class="heading">Usage: </dt><dd class="value"><div><tt>+p</tt></div>
</dd></dl>
</div>
</li>
<li><span>Operator: <a href="../../Macaulay2Doc/html/__pl.html" title="a unary or binary operator, usually used for addition">+</a></span></li>
<li><div class="single">Inputs:<ul><li><span><tt>p</tt>, <span>a <a href="___Parser.html">parser</a></span></span></li>
</ul>
</div>
</li>
<li><div class="single">Outputs:<ul><li><span><span>a <a href="___Parser.html">parser</a></span>, a parser that will feed its tokens through <tt>p</tt>, and then when further tokens are not accepted, it will start over with a fresh copy of <tt>p</tt>.  The value returned is the sequence of values returned by each instance of <tt>p</tt>.</span></li>
</ul>
</div>
</li>
</ul>
</div>
<div class="single"><h2>Description</h2>
<div><table class="examples"><tr><td><pre>i1 : (+ constParser "abc" : charAnalyzer) "abcabcabc"

o1 = (abc, abc, abc)

o1 : Sequence</pre>
</td></tr>
</table>
</div>
</div>
<div class="waystouse"><div class="single"><h2>Code</h2>
<pre>../Parsing.m2:141:14-141:32: --source code:
+Parser := p -> prepend % p @ *p</pre>
</div>
</div>
<div class="single"><h2>See also</h2>
<ul><li><span><a href="_const__Parser.html" title="produce a parser that accepts a fixed string, one character at a time">constParser</a> -- produce a parser that accepts a fixed string, one character at a time</span></li>
<li><span><a href="_char__Analyzer.html" title="a lexical analyzer that provides characters from a string one at a time">charAnalyzer</a> -- a lexical analyzer that provides characters from a string one at a time</span></li>
<li><span><a href="___Parser_sp_co_sp__Analyzer.html" title="combine a parser with a lexical analyzer to make a complete system">Parser : Analyzer</a> -- combine a parser with a lexical analyzer to make a complete system</span></li>
</ul>
</div>
</div>
</body>
</html>