On Monday, 12 March 2012 at 01:02:06 UTC, Walter Bright wrote:
Are any parts of it suitable for inclusion in
https://github.com/D-Programming-Deimos ?
Doubt it, as it literally simply opens up a gnuplot process and
pipes commands into it. There is no such thing as a libgnuplot or
anything.
On 12-03-2012 02:27, Alex Rønne Petersen wrote:
On 11-03-2012 00:28, Philippe Sigaud wrote:
Hello,
I created a new Github project, Pegged, a Parsing Expression Grammar
(PEG) generator in D.
https://github.com/PhilippeSigaud/Pegged
docs: https://github.com/PhilippeSigaud/Pegged/wiki
PEG: http
On 11-03-2012 00:28, Philippe Sigaud wrote:
Hello,
I created a new Github project, Pegged, a Parsing Expression Grammar
(PEG) generator in D.
https://github.com/PhilippeSigaud/Pegged
docs: https://github.com/PhilippeSigaud/Pegged/wiki
PEG: http://en.wikipedia.org/wiki/Parsing_expression_gramm
On 3/11/2012 2:45 PM, SiegeLord wrote:
Anyway, the repository for it is here: https://github.com/SiegeLord/DGnuplot
It requires TangoD2 to build and gnuplot 4.4.3 to run (unless you're saving
commands to a file as described above).
It works on Linux, and maybe on Windows (untested).
Great!
Are
On 3/11/12 3:02 AM, Philippe Sigaud wrote:
There is an operator to drop unnecessary nodes (':').
Good.
Apart from that,
a Pegged grammar is a self-contained entity: it automatically cuts
nodes coming from other grammars, to simplify the tree (it keeps the
matcheds substrings, of course). I pl
On Sunday, 11 March 2012 at 21:45:02 UTC, SiegeLord wrote:
I have been using a GNUPlot controller for my scientific work
with D for some time now, so I just wanted to announce that
such a thing exists if anybody is interested in using it or
whatnot. It supports very some basic features (hence b
I have been using a GNUPlot controller for my scientific work
with D for some time now, so I just wanted to announce that such
a thing exists if anybody is interested in using it or whatnot.
It supports very some basic features (hence being low feature)
which you can view in the example file:
On 11-03-2012 18:17, Philippe Sigaud wrote:
> By the way, bootstrap.d seems to fail to build at the moment:
>
> ../pegged/utils/bootstrap.d(1433): found ':' when expecting ')'
following template argument list
> ../pegged/utils/bootstrap.d(1433): members expected
> ../pegged/utils/bootstrap.d
On 11-03-2012 18:19, Philippe Sigaud wrote:
> Hm, I don't *think* C has such ambiguities but I could well be wrong.
In any case, if it can handle the non-ambiguous case, that's enough for me.
I wanted to tackle D this week, but I might as well begin with C :)
Do you happen to have any handy an
> Hm, I don't *think* C has such ambiguities but I could well be wrong. In
any case, if it can handle the non-ambiguous case, that's enough for me.
I wanted to tackle D this week, but I might as well begin with C :)
Do you happen to have any handy and readable EBNF grammar for C? At least
for D,
> By the way, bootstrap.d seems to fail to build at the moment:
>
> ../pegged/utils/bootstrap.d(1433): found ':' when expecting ')' following
template argument list
> ../pegged/utils/bootstrap.d(1433): members expected
> ../pegged/utils/bootstrap.d(1433): { } expected following aggregate
declaratio
On 11-03-2012 18:06, Philippe Sigaud wrote:
>> On Sun, Mar 11, 2012 at 00:34, Alex Rønne
Petersenmailto:xtzgzo...@gmail.com>> wrote:
[Parsing C?]
>> I think so. But you'd have to do add some semantic action to deal with
>> typedefs and macros.
>
>
> Oh, I should have mentioned I only mean
> Also, I have sent a pull request to fix the build on 64-bit:
https://github.com/PhilippeSigaud/Pegged/pull/1
Merged, thanks!
> Quick question, you mention the ability to opt-out of the
space-insensitivity, where might one find this?
Yes, undocumented. Use the '>' operator.
You know, I introduced space-insensitivity recently, to simplify some rules
and it keeps biting me back.
For example
Line <- (!EOL .)* EOL
The ca
alex:
> Question: Are the generated parsers, AST nodes, etc classes or structs?
They are structs. See:
https://github.com/PhilippeSigaud/Pegged/wiki/Parse-Trees
>> On Sun, Mar 11, 2012 at 00:34, Alex Rønne Petersen
wrote:
[Parsing C?]
>> I think so. But you'd have to do add some semantic action to deal with
>> typedefs and macros.
>
>
> Oh, I should have mentioned I only meant the actual language (ignoring
the preprocessor).
OK. I admit I downloaded the
On 11-03-2012 16:02, Alex Rønne Petersen wrote:
On 11-03-2012 00:28, Philippe Sigaud wrote:
Hello,
I created a new Github project, Pegged, a Parsing Expression Grammar
(PEG) generator in D.
https://github.com/PhilippeSigaud/Pegged
docs: https://github.com/PhilippeSigaud/Pegged/wiki
PEG: http
On 11-03-2012 00:28, Philippe Sigaud wrote:
Hello,
I created a new Github project, Pegged, a Parsing Expression Grammar
(PEG) generator in D.
https://github.com/PhilippeSigaud/Pegged
docs: https://github.com/PhilippeSigaud/Pegged/wiki
PEG: http://en.wikipedia.org/wiki/Parsing_expression_gramm
On 3/11/12 24:28 , Philippe Sigaud wrote:
Hello,
I created a new Github project, Pegged, a Parsing Expression Grammar
(PEG) generator in D.
Philippe
Very cool!
Quick question, you mention the ability to opt-out of the
space-insensitivity, where might one find this?
Thanks!
On 11-03-2012 00:28, Philippe Sigaud wrote:
Hello,
I created a new Github project, Pegged, a Parsing Expression Grammar
(PEG) generator in D.
https://github.com/PhilippeSigaud/Pegged
docs: https://github.com/PhilippeSigaud/Pegged/wiki
PEG: http://en.wikipedia.org/wiki/Parsing_expression_gramm
On 11-03-2012 08:22, Philippe Sigaud wrote:
On Sun, Mar 11, 2012 at 00:34, Alex Rønne Petersen wrote:
Admittedly I have not heard of PEGs before, so I'm curious: Is this powerful
enough to parse a language such as C?
I think so. But you'd have to do add some semantic action to deal with
type
On Sun, Mar 11, 2012 at 08:51, Andrei Alexandrescu
wrote:
> I was thinking of ANTLR-style operators in which you say where the root
> should be and you get to drop unnecessary nodes.
>
> (Post on 2012/02/29 10:19AM GMT-0600.)
Get it, thanks for the ref!
There is an operator to drop unnecessary
22 matches
Mail list logo
