<feed xmlns='http://www.w3.org/2005/Atom'>
<title>lpeg/makefile, branch master</title>
<subtitle>A mirror of https://github.com/roberto-ieru/LPeg.git
</subtitle>
<id>https://git.lua4.win/lpeg/atom?h=master</id>
<link rel='self' href='https://git.lua4.win/lpeg/atom?h=master'/>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/'/>
<updated>2025-04-14T20:16:19+00:00</updated>
<entry>
<title>Some refactoring in debug code</title>
<updated>2025-04-14T20:16:19+00:00</updated>
<author>
<name>Roberto Ierusalimschy</name>
<email>roberto@inf.puc-rio.br</email>
</author>
<published>2025-04-14T20:16:19+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/commit/?id=eb8b906d5eb5113e7377f06afbfd641c1c5e6a1e'/>
<id>urn:sha1:eb8b906d5eb5113e7377f06afbfd641c1c5e6a1e</id>
<content type='text'>
Functions lp_printtree and lp_printcode moved to lpprint.c, to
concentrate there debug/testing code.
</content>
</entry>
<entry>
<title>New way to detect loops in 'verifyrule'</title>
<updated>2025-04-10T18:54:21+00:00</updated>
<author>
<name>Roberto Ierusalimschy</name>
<email>roberto@inf.puc-rio.br</email>
</author>
<published>2025-04-10T18:54:21+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/commit/?id=0ac14cf58c5b1c954e979dc35e50e610e8dd5115'/>
<id>urn:sha1:0ac14cf58c5b1c954e979dc35e50e610e8dd5115</id>
<content type='text'>
Instead of counting visits, mark each rule being visited, as is usual
for detecting loops when traversing a graph.
</content>
</entry>
<entry>
<title>Small improvements</title>
<updated>2024-06-17T19:25:25+00:00</updated>
<author>
<name>Roberto Ierusalimschy</name>
<email>roberto@inf.puc-rio.br</email>
</author>
<published>2024-06-17T19:25:25+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/commit/?id=80ec9f932aa01d445e86c699523265359055e1bd'/>
<id>urn:sha1:80ec9f932aa01d445e86c699523265359055e1bd</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Added a README file</title>
<updated>2023-06-23T18:04:04+00:00</updated>
<author>
<name>Roberto Ierusalimschy</name>
<email>roberto@inf.puc-rio.br</email>
</author>
<published>2023-06-23T18:04:04+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/commit/?id=097bebd29949edf6ed7bd55d8fb21c477ac85236'/>
<id>urn:sha1:097bebd29949edf6ed7bd55d8fb21c477ac85236</id>
<content type='text'>
</content>
</entry>
<entry>
<title>First implementation for the accumulator capture</title>
<updated>2023-06-06T20:50:31+00:00</updated>
<author>
<name>Roberto Ierusalimschy</name>
<email>roberto@inf.puc-rio.br</email>
</author>
<published>2023-06-06T20:50:31+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/commit/?id=e31e13f59ef1a4df1698b15ff1fe0198553cc3c2'/>
<id>urn:sha1:e31e13f59ef1a4df1698b15ff1fe0198553cc3c2</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Compact charsets used in trees, too.</title>
<updated>2023-04-27T13:32:39+00:00</updated>
<author>
<name>Roberto Ierusalimschy</name>
<email>roberto@inf.puc-rio.br</email>
</author>
<published>2023-04-27T13:32:39+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/commit/?id=012cf9c86cf91cb8354e229bde335592d41b84b2'/>
<id>urn:sha1:012cf9c86cf91cb8354e229bde335592d41b84b2</id>
<content type='text'>
</content>
</entry>
<entry>
<title>New module 'lpcset'</title>
<updated>2023-04-26T16:36:34+00:00</updated>
<author>
<name>Roberto Ierusalimschy</name>
<email>roberto@inf.puc-rio.br</email>
</author>
<published>2023-04-26T16:36:34+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/commit/?id=3403b0c7256435560b63f828da92026c5d4c898b'/>
<id>urn:sha1:3403b0c7256435560b63f828da92026c5d4c898b</id>
<content type='text'>
For code related to compact sets.
</content>
</entry>
<entry>
<title>Details</title>
<updated>2022-07-06T20:03:22+00:00</updated>
<author>
<name>Roberto Ierusalimschy</name>
<email>roberto@inf.puc-rio.br</email>
</author>
<published>2022-07-06T20:03:22+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/commit/?id=99cd4b9125ed5bd5f7e5b6756da4f4c0efdebca0'/>
<id>urn:sha1:99cd4b9125ed5bd5f7e5b6756da4f4c0efdebca0</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Some details before release 1.0.2</title>
<updated>2019-03-11T14:04:25+00:00</updated>
<author>
<name>Roberto Ierusalimschy</name>
<email>roberto@inf.puc-rio.br</email>
</author>
<published>2019-03-11T14:04:25+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/commit/?id=d9f83dded93a35fb333c4e1bd371c401f7129fd1'/>
<id>urn:sha1:d9f83dded93a35fb333c4e1bd371c401f7129fd1</id>
<content type='text'>
- changed release number
- small corrections in 'pack'
- removed "about" section in .html files
- added files 'HISTORY' and 'lpeg-128.gif'
</content>
</entry>
<entry>
<title>Avoid stack overflow when handling nested captures</title>
<updated>2019-02-20T14:11:12+00:00</updated>
<author>
<name>Roberto Ierusalimschy</name>
<email>roberto@inf.puc-rio.br</email>
</author>
<published>2019-02-20T14:11:12+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/lpeg/commit/?id=f53caf1f863f140de1c1af51906e658c9fb7d7d6'/>
<id>urn:sha1:f53caf1f863f140de1c1af51906e658c9fb7d7d6</id>
<content type='text'>
The C code uses recursion to handle nested captures, so a too deep
nesting could create a stack overflow. The fix limits the handling
of nested captures to 'MAXRECLEVEL' (default is 200 levels).
</content>
</entry>
</feed>
