Hey tomás,
On 1/20/19 9:32 AM, to...@tuxteam.de wrote:
>> My best bet for applying such a thing would
>> be to search through old documents from university [...] But this
>> is also only to prove that a language is not regular, if I recall
>> correctly.
> There's one
On Sat, Jan 19, 2019 at 02:23:58PM +0100, Zelphir Kaltstahl wrote:
>
> On 1/17/19 11:49 AM, to...@tuxteam.de wrote:
[...]
> Thanks tomás!
>
> I know the Chomsky Hierarchy exists for languages and I remember there
> was some thing called pumping lemma, which I forgot how to use years ago
>
On 1/17/19 11:49 AM, to...@tuxteam.de wrote:
> On Thu, Jan 17, 2019 at 08:43:01AM +0100, Zelphir Kaltstahl wrote:
>
>>> I am still unsure about the theoretical CS stuff: What kind of parsers
>>> one can possibly write with parser combinators [...]
> [...]
>
>>> Have you looked at the PEG
On 1/18/19 6:00 PM, guile-user-requ...@gnu.org wrote:
> For example, what is the difference
>> between PEG parsing and parser combinators?
>>
> Both of them do top-down parsing (try to match the top-level grammar rule,
> which is
> done by trying to match the lower-level rules which make it up,
On Thu, Jan 17, 2019 at 2:56 AM Zelphir Kaltstahl <
zelphirkaltst...@gmail.com> wrote:
For example, what is the difference
> between PEG parsing and parser combinators?
>
Both of them do top-down parsing (try to match the top-level grammar rule,
which is
done by trying to match the lower-level
On Thu, Jan 17, 2019 at 08:43:01AM +0100, Zelphir Kaltstahl wrote:
> > I am still unsure about the theoretical CS stuff: What kind of parsers
> > one can possibly write with parser combinators [...]
[...]
> > Have you looked at the PEG parser recently added to guile? It does
> >
Hi Swedebugia,
I did not notice a PEG parser has been added. How did you notice this?
Maybe there is another blog for new additions to Guile?
Do you know a good text, which explains differences between the
different approaches to parsing? For example, what is the difference
On 1/17/19 8:16 AM, swedebugia wrote:
> Zelphir Kaltstahl skrev: (16 januari 2019
> 21:31:13 CET)
>
> Perhaps I should put a link into the source code whenever I follow a
> tutorial. Sorry for the confusion!
>
> I am also only following Amirouche Boubekki's tutorial ; ) Good that
Zelphir Kaltstahl skrev: (16 januari 2019
21:31:13 CET)
Perhaps I should put a link into the source code whenever I follow a
tutorial. Sorry for the confusion!
I am also only following Amirouche Boubekki's tutorial ; ) Good that you
already found it.
There is a paper about parser
On Wed, Jan 16, 2019 at 09:31:13PM +0100, Zelphir Kaltstahl wrote:
> Perhaps I should put a link into the source code whenever I follow a
> tutorial. Sorry for the confusion!
[...]
> I am still unsure about the theoretical CS stuff: What kind of parsers
> one can possibly write with parser
Perhaps I should put a link into the source code whenever I follow a
tutorial. Sorry for the confusion!
I am also only following Amirouche Boubekki's tutorial ; ) Good that you
already found it.
There is a paper about parser combinators (which I did not completely
implement, because I had a bug
On Wed, Jan 16, 2019 at 11:39 AM Catonano wrote:
>
> Il giorno mer 16 gen 2019 alle ore 09:21 Catonano ha
> scritto:
>
> > Hello,
> >
> > I'm reading the parsers tuorial in Zelpir's examples repository
> >
> > I don't understand where the procedure "parse-result" is defined
> >
> > The first
Il giorno mer 16 gen 2019 alle ore 09:21 Catonano ha
scritto:
> Hello,
>
> I'm reading the parsers tuorial in Zelpir's examples repository
>
> I don't understand where the procedure "parse-result" is defined
>
> The first occurrence of it is on line 29
>
>
>
13 matches
Mail list logo
