No. Strangely enough they don't in enforce this limit.<br /><br clear="all" />Brent DeSpain<br />Schweitzer
EngineeringLaboratories, Inc.<br /><br /><br /><div class="gmail_quote">On Thu, May 27, 2010 at 2:59 PM, Andrej <span
dir="ltr"><<ahref="mailto:andrej.groups@gmail.com">andrej.groups@gmail.com</a>></span> wrote:<br /><blockquote
class="gmail_quote"style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left:
1ex;"><divclass="im">On 28 May 2010 07:33, Brent DeSpain <<a
href="mailto:bd.postgres@gmail.com">bd.postgres@gmail.com</a>>wrote:<br /> > In the docs<br /> > <a
href="http://www.postgresql.org/docs/8.3/interactive/functions-matching.html#POSIX-EMBEDDED-OPTIONS-TABLE"
target="_blank">http://www.postgresql.org/docs/8.3/interactive/functions-matching.html#POSIX-EMBEDDED-OPTIONS-TABLE</a><br
/>> it says that Regular Expression bounds {m,n} that m and n can be 0-255. Is<br /> > there a way to extend the
upperlimit. We are trying to be consistent<br /> > between Regular Expressionimplementation an the other
implementationsdo not<br /> > have this limit.<br /></div>Interesting. The POSIX standard for REs dictates this
limit;which<br /> implementations<br /> you're using don't adhere to it?<br /><br /><br /> Cheers,<br /> Andrej<br
/><fontcolor="#888888"><br /><br /><br /><br /> --<br /> Please don't top post, and don't use HTML e-Mail :} Make your
quotesconcise.<br /><br /><a href="http://www.american.edu/econ/notes/htmlmail.htm"
target="_blank">http://www.american.edu/econ/notes/htmlmail.htm</a><br/></font></blockquote></div><br />