[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[AUCTeX-devel] The parsing algorithm

From: Ralf Angeli
Subject: [AUCTeX-devel] The parsing algorithm
Date: Sun, 08 Jun 2008 10:40:15 +0200

At <URL:>
one can find a bug report for Emacs' TeX mode about an error not being
handled correctly.  AUCTeX's parser fails as well in this exercise
because of opening parens coming from math in the LaTeX file which do
not have matching closing parens.

Anyway, what I found interesting when investigating the bug is that the
parser in tex-mode.el uses a different approach than AUCTeX's parser.
It first searches for an error position and then tries to find the file
associated with the error.  In course of that it checks for every
interesting position (opening parens) if the the string at the position
is a readable file.

Although the approach fails at the example mentioned above i looks more
robust to me than what AUCTeX does, namely walking through the whole
output and maintaining a stack of strings where some are file names and
some are not.  I thought about checking for file readability as well
when pushing elements onto the stack but this would make deciding which
names to pop from the stack much more difficult when a closing paren is

Working on the parser is not my number one priority at the moment but
perhaps looking at what tex-mode.el does might prove useful when we get
the next bug report about it or in case somebody will have a shot at
merging the parsers of AUCTeX and preview-latex at some time.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]