[sword-devel] search idea

Trevor Jenkins sword-devel@crosswire.org
Sat, 15 Jan 2000 18:03:42 +0000


On Thursday, 6 January, 2000 10:51:02, Matthias Ansorg <aNsis@gmx.de> wrote:

> On Tue, 4 Jan 2000, Trevor Jenkins wrote:
>
>>... I can write an LL(1) parser to deal with this language; even
>>write it standing on my head but writing that grammar down in a concise
>>format is taking some time.
>
> What is an LL(1) parser? You know, my little understanding .-)

Sorry, again assuming that every one here is a comp. sci. major.

An LL(1) parser will analyse a "sentence" using a single symbol lookahead,
which is the L and (1). It will also take the left most non-terminal in each
grammar rule to parse that sentence.

For most practical purposes an LL(1) grammar can be parsed using a recursive
descent parser. The most famous use of this technique being the Pascal
compiler from Wirth. If you were to write a parser for Pascal following the
syntax diagrams often used in text books then you'd create a recursive
descent parser.

Regards, Trevor

British Sign Language is not inarticulate handwaving; it's a living
language. So recognise it now.

--

<>< Re: deemed!