OK.
--
You received this message because you are subscribed to the Google Groups
"marpa parser" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to marpa-parser+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
On Tue, Sep 23, 2014 at 2:14 AM, Ron Savage wrote:
> Thanx for the link.
>>
>
> 2 of those 3 samples (the 2nd & 3rd) produce ambiguous parses. Is that
> what you find too?
>
Yes, the code warns about it; actually I was planning to deal with it as
part of my current work on ASF-based disambiguatio
I think I'll release such samples (I have encountered a few) as
MarpaX::Demo::SampleGrammars. It'll be basically a dummy module with the
good stuff in scripts/*.pl.
I've been thinking about a script collection for many months now.
Any other suggestions (module name, code to include)?
--
You r
>
> Thanx for the link.
>
2 of those 3 samples (the 2nd & 3rd) produce ambiguous parses. Is that what
you find too?
--
You received this message because you are subscribed to the Google Groups
"marpa parser" group.
To unsubscribe from this group and stop receiving emails from it, send an em
Thanx for the code. I'm turn it into a program for studying.
As per my reply to rns, the Graphviz DOT language is the ultimate target,
and my code for that already uses various events.
That's not to say events are mandatory. Indeed, the original version of the
code only ever had events because
Thanx for the link.
I did not consider that case, since I'm really interested in the Graphviz
DOT file format, where quotes if any must be double quotes, and internal
quotes must be escaped.
However, I will examine the code you link to, since ever such example is
interesting.
--
You received
I've posted some things previously on this topic - but in short, you don't
really need to use events to do this. It's possible to do it in a
semi-straightforward fashion without a lot of jumping through hoops (just a
bunch of rules).
Here's some grammar fragments demonstrating what I'm talking
Does parsing nested quotes make sense for adding to that grammar? I once
ran into a grammar that can parse them to a tree —
https://gist.github.com/rns/23ce8639c4ceb87d70c9
On Mon, Sep 22, 2014 at 10:12 AM, Ron Savage wrote:
> I've developed a grammar (with help from various people of course) fo
I've developed a grammar (with help from various people of course) for
quoted strings: http://scsys.co.uk:8002/424926
Requirements:
o Strings must be quoted
o Strings are either single or double quoted
o The escape character is \
o If the string is single quoted, internal single quotes must b
