home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.theory
- Path: sparky!uunet!spool.mu.edu!yale.edu!ira.uka.de!math.fu-berlin.de!weberwu
- From: weberwu@inf.fu-berlin.de (Debora Weber-Wulff)
- Subject: What kind of an automaton is this?
- Message-ID: <4QU69WW@math.fu-berlin.de>
- Sender: news@math.fu-berlin.de (Math Department)
- Reply-To: dww@inf.fu-berlin.de
- Organization: Free University of Berlin
- Date: Wed, 9 Sep 1992 13:13:57 GMT
- Lines: 23
-
- We've been discussing on comp.compilers the kind of parsing automaton that is described in
- DeRemer[CACM 71] as being an SLR-Parser. It is not the kind of PDA I
- learned about when I studied Automata Theory with the next state and the
- output being determined by the current state, the top of the stack, and
- the current symbol in the input. In this "strange" automaton the lhs of
- the production being reduced is returned to the input after the stack
- has been popped. This is not just backing up over input, but non-terminals
- can be built up on the input, perhaps with a number of epsilon productions.
- Some people have said "oh yes, we like that and have a hack to use it"
- but it is unclear what exactly the computational complexity of this
- automaton is. LR parsing is clearly a subset of what this automaton can
- do - just don't do any of the strange reductions.
-
- Has anyone encountered this type of automaton before? What does it buy
- me, i.e. what special problems could be solved with this type of
- automaton that we can't do with LR-parsers? Pointers or ideas of
- any kind are welcome.
-
- --
- Debora Weber-Wulff dww@inf.fu-berlin.de
- Institut fuer Informatik +49 30 89691 124
- Nestorstr. 8-9 (INCLUDE "standard.disclaimer")
- D-W-1000 Berlin 31 (PRINTN (WITTY-MESSAGE TODAY))
-