Construct a DFA that accepts the language generated by the grammar S--> abS | A
ID: 3603998 • Letter: C
Question
Construct a DFA that accepts the language generated by the grammar
S--> abS | A
A--> baB
B--> aA|bb
Question: below is a graph for the NFA of the grammar. In the process of converting the NFA to a DFA, my question is, how can S, with transition of b, go to 2? Shouldnt it go to A2?. And 1 with transitoins of B, shouldnt it go to SA2, not SA? Will give thumbs up
3Explanation / Answer
using System; using System.IO; using System.Collections; using System.Linq; class program { public static void Main(string[] args) { var t = typeof(IEnumerable); var typesIEnum = AppDomain.CurrentDomain.GetAssemblies().SelectMany(x => x.GetTypes()).Where(x => t.IsAssignableFrom(x)); foreach (var types in typesIEnum) { Console.WriteLine(types.FullName); } Console.ReadLine(); } }