The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?
Answer - A
In compiler lexical analyzer categorizes character sequence into lexemes and produces tokens as output for parser. And tokens are expressed in regular expressions so a simple Finite Automata is sufficient for it.
Can u explain how TM used in semantic analysis??
@akash.dinkar12 @rajinder singh
we use context sensitive language in semantics analysis phase. So, we need a linear bounded turing machine to implement that.
Can someone help me understand examples on...