CODEWITHSUNDEEP
bison
Maciek99
Maciek99

Reputation: 1

Bison - what is the result?

I know that using bison I get a parser LALR, but is it true to say that this parser is deterministic finite automata ( and deterministic finite automata with stack ) ?

Upvotes: 0

Views: 185

Answers (1)

Chris Dodd
Chris Dodd

Reputation: 126408

No, the result of bison is deterministic pushdown automaton, not a finite automaton. This is an entirely different class of automaton.

Of course, since it is run in a physical computer, it has finite limits (it does not allow for infinite stack space), but as a theoretical construct, it is quite different from a finite automaton. You can to some extent describe a DPDA as 'just' a DFA plus an unbounded stack, but that really misses the point.

Upvotes: 1

Related Questions