Regular LALR grammars

How are regular parser grammars handled by the parser generator? I know
how a grammar using regular expressions (ie. EBNF) can be converted to
BNF, but does a regular-grammar parser use the regular expressions during
closure? ie.


x -> a*


what would the Closure of: x -> . a*
be:


x -> . a
-> a . ?




If this is correct, I assume + and optional [] are handled similarly:




for x -> .a+


closure of: x -> .a+
is: x -> .a


closure of: x -> a+.
is: x -> a.
-> .a




for x -> [a]
closure of: x -> .[a]
is: x -> .a
-> a.






Is this correct or will it have the same effect as transforming the grammar
to BNF-form only?
--
Simon Huntington
Software Interrupt Developments. Leeds, UK.
--

Return to the comp.compilers page.
Search the comp.compilers archives again.