Draw NFA for the language L={ a n b | n≥5 } defined over Σ={a,b}. Implement it using LEX/FLEX and YACC/BISON. Test it with the strings ab, aaaaab, aabb, aaaaaaab and aaaaaabb. Give the source code and...

Draw NFA for the language L={ aⁿb | n≥5 } defined over Σ={a,b}. Implement it using LEX/FLEX and YACC/BISON. Test it with the strings ab, aaaaab, aabb, aaaaaaab and aaaaaabb. Give the source code and the runtime screen with compilation and execution steps.

course name compiler constructionsi