Given Prefix Expression: (а) * — + АВCD (b) + — а * ВCD Convert to INFIX!

Im trying to program a lexical analyzer in C/C++ I really just need help putting the switch cases in line so that when the lexeme is found in my file the token will be printed showing what lexemes are in the file

6

For each one of the following languages over alphabet {a, b}, write an equivalent regular expression. (a) All strings made out of zero or more b's: (b) All strings that do not start with bb. (c) All strings that end with aaa or bb (d) All strings that start and end with the same alphabet letter.

PROGRAMMING LANGUAGE: C++

Define the term " operator prefix increment " .

Q: Define a RE for language that contains even number of b’s Define a RE for language that contains even number of b’sDefine a RE for language that contains even number of 1’s

Obtain an NFA to accept the following language L= { w\w e abab" or aba" where n20}

Q1) Find DFA's for the following languages:

NFA STRING 011