[prev in list] [next in list] [prev in thread] [next in thread] 

List:       lilypond-devel
Subject:    Re: looking at lilypond data structures
From:       David Kastrup <dak () gnu ! org>
Date:       2018-04-14 17:36:53
Message-ID: 87zi25y9je.fsf () fencepost ! gnu ! org
[Download RAW message or body]

Kim Shrier <kim@westryn.net> writes:

> On Apr 14, 2018, at 2:48 AM, David Kastrup <dak@gnu.org> wrote:
>> 
>> Kim Shrier <kim@westryn.net> writes:
>> 
>>> Just to satisfy personal curiosity, I am looking at the lilypond source code
>>> so I can get a better feel for what it is up to and how it accomplishes its
>>> job.
>>> 
>>> My understanding is that the parser constructs a scheme data structure
>>> which is subsequently processed by the iterators to turn it into a stream
>>> (or several streams) of musical events.  Before I start looking at the
>>> iterators, I would like to see what they are working with for input.
>>> 
>>> So, I have a few questions.
>>> 
>>> Is my understanding correct that the parser produces a single scheme
>>> expression that is then processed for use in later stages?
>> 
>> No.  The parser calls various hook functions for processing elements
>> encountered in the input such as scores, markups, books, bookparts.
>
> I got that mistaken impression from reading Erik Sandberg's paper.

Erik Sandberg's paper is not LilyPond documentation.  It documents an
experimental branch for the code he used in his thesis long long ago
that was to significant degrees not folded into LilyPond proper.

-- 
David Kastrup

_______________________________________________
lilypond-devel mailing list
lilypond-devel@gnu.org
https://lists.gnu.org/mailman/listinfo/lilypond-devel

[prev in list] [next in list] [prev in thread] [next in thread]