LATEX-L Archives

Mailing list for the LaTeX3 project


Options: Use Classic View

Use Proportional Font
Show Text Part by Default
Show All Mail Headers

Topic: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Lars Hellström <[log in to unmask]>
Thu, 13 Oct 2011 17:25:35 +0200
text/plain (76 lines)
Bruno Le Floch skrev 2011-10-12 04.59:
>>> I looked at that this afternoon. Would that be the right framework for
>>> code pretty-printing similar to listings/minted (but hopefully more
>>> powerful)?
>> Strongly yes. As Ford mentions in his POPL paper on PEGs, the traditional
>> context-free grammars suck at expressing things like "an identifier is a
>> _longest_ sequence of consecutive alphanumeric characters", which is why
>> there is typically a separate tokenising step before the parser proper.
>> PEGs, on the other hand, have no problem with parsing from the character
>> level and up in one go. For pretty-printing, I'd expect it to be a great
>> convenience to not have to do it in two steps.
> Do you have any idea on the natural resulting data structure? It's not
> clear how trees should be implemented in TeX.

I would suggest just return a token sequence, into which the TeX commands 
the user specified has been inserted to reflect the aspects of the structure 
that he's interested in. A silly example might be something like

\begin{VerbPhrase}\begin{Verb}is\end{Verb} full 

It seems to be a fairly standard extension that something inside braces in 
an PEG means "When passing through here upon matching, then insert this 
piece of material." An awkward point is however that you'd often want to 
insert an opening brace at one point and a closing brace a bit later -- for 
example to make that \Noun{hovercraft} rather than the less flexible 
\begin{Noun}hovercraft\end{Noun} -- which is not obvious how to express.

> Also, PEGs seem to lead
> to endless trouble with left recursion. I'm a little bit afraid of
> fighting an open problem :).

I'd be inclined to consider a grammar with a left recursion loop a 
programming error, just like it is for ordinary TeX macros. There is a 
transformation of PEGs that turn left-recursion into runtime match failures 
rather than infinite loops, but I don't know how complicated it is, and I 
suspect it's mainly interesting when the PEG effectively gets compiled to 
machine code. LaTeX already runs inside the TeX virtual machine, so an 
infinite loop is not that fatal.

> I haven't thought about doing it as a pure NFA. I think I'll go for
> the most economical solution of running the assertion automaton on the
> string, since that feature will probably not be used too much. I still
> need to think of a good way of matching backwards, though (I believe
> it is simply reversing all the transitions in the automaton,

And exchanging the sets of initial and final states. Yes, that's all there 
is to it. (I assume you don't worry about submatch capturing there anyway.)

> but the
> representation I have makes that non-trivial).

It is often there that the crux lies.

[other mail]
>> > As Will says, an alternative is simply to save all regexes
>> > automatically, and check for the existence of the regex before building
>> > it. That of course costs in terms of macros, so the question is how many
>> > regexes are likely to be used. (We are talking about a typesetting
>> > system, so really this should not normally be 100s.)
> You guys are right. I'll add this automatic storage this weekend, and
> remove the N variants (since they will be done automatically).

I'm not so fond of that idea. I'd expect a bunch of regexps to be one-timers 
used during package initialisation, and keeping all of those around forever 
feels like it will be a lot of bloat. I'd prefer having both N and n 
variants, as in the initial version.

Lars Hellström