Author: wayland
Date: 2010-06-05 01:33:27 +0200 (Sat, 05 Jun 2010)
New Revision: 31116
Modified:
docs/Perl6/Spec/S32-setting-library/Rules.pod
Log:
Made some changes based on S05 -- they may even be right :).
Modified: docs/Perl6/Spec/S32-setting-library/Rules.pod
Hi. I've been thinking more about reversible grammars. Specifically,
I'm wondering if the following pseudo-code will be possible:
## Match a grammar here
$match = Grammar.match($text)
## Need some code here to get $submatch from $match
$submatch.Str = fred
## Reverse Grammar
$text =
On Sat, Jun 05, 2010 at 09:19:01AM +1000, Timothy S. Nelson wrote:
Hi. I've been thinking more about reversible grammars. Specifically,
I'm wondering if the following pseudo-code will be possible:
## Match a grammar here
$match = Grammar.match($text)
## Need some code here to get
Author: lwall
Date: 2010-06-05 02:28:09 +0200 (Sat, 05 Jun 2010)
New Revision: 31117
Modified:
docs/Perl6/Spec/S05-regex.pod
Log:
[S05] some clarifications suggested by sorear++
Modified: docs/Perl6/Spec/S05-regex.pod
===
---
On Fri, 4 Jun 2010, Stefan O'Rear wrote:
On Sat, Jun 05, 2010 at 09:19:01AM +1000, Timothy S. Nelson wrote:
Hi. I've been thinking more about reversible grammars. Specifically,
I'm wondering if the following pseudo-code will be possible:
## Match a grammar here
$match =
Author: allbery_b
Date: 2010-06-05 04:52:12 +0200 (Sat, 05 Jun 2010)
New Revision: 31118
Modified:
docs/Perl6/Spec/S05-regex.pod
Log:
[S05] typo
Modified: docs/Perl6/Spec/S05-regex.pod
===
--- docs/Perl6/Spec/S05-regex.pod
