Are regular expressions LR(k)?
If I have a Type 3 Grammar, it can be represented on a pushdown automaton (without doing any operation on the stack) so I can represent regexp by using context free languages. But can I know if a type 3 grammar is LR(1)/LL(1)/SLR(1)[...] without doing any parse table?
Are regular expressions LR(k)?
===

If I have a Type 3 Grammar, it can be represented on a pushdown automaton (without doing any operation on the stack) so I can represent regexp by using context free languages. But can I know if a type 3 grammar is LR(1)/LL(1)/SLR(1)[...] without doing any parse table?