write the code in java

Required Components:

a$.$ Coding Project Files: Include all code files, neatly organized.

b$.$ Detailed Report: Explain project algorithms, and include clear Output Screenshots to show code results for various test cases.

d$.$ Instead of class discusion, you will submit a Short Demo Video: Provide a $5-7$ minute live demonstration to discuss the algorithm implementation $($The code$).$

Submission Method: Use blackboard assignment submission box.

Checklist: Ensure code is well$-$documented, report is organized, screenshots are clear, and the video is concise.

Build a program that simulate the subset construction algorithm to convert a given NFA to DFA.

a$.$ The program takes as an input the mathematical representation of the NFA including the following:

i$.$ Set of states $S$

ii$.$ Start State S$0$

iii. Alphabet $$

iv$.$ Final State$($s$)$ F

v$.$ Transition T

b$.$ Then, it will display the converted equivalent DFA mathematical representation.

Implement a top$-$down parser $($Predictive parser $-$ LL$1).$

a$.$ The program takes an input as following:

i$.$ The number of productions, and each production rules.

ii$.$ The first symbols of each rule.

iii. The number of terminals, and each terminal symbol.

iv$.$ The number of non$-$terminals, each non$-$terminal symbol, and the follow of each non$-$terminal.

b$.$ The program should construct and display the LL$1$ parse table.

c$.$ Test your constructed table by asking for a string as input. Then, show the parsing action and stack status step$-$by$-$step until the algorithm decide whether the input string is accepted or rejected.