You

are

required

to

develop

a

Lexical

Analyzer

(Lexer)

and

a

Parser

in

Java

and

JavaFX

JavaFX (30 Points) You are required to develop a Lexical Analyzer (Lexer) and a Parser in Java and JavaFX. Show the output in GUI using JavaFX i.e., the output of the parser (Abstract Syntax Tree-AST) and lexer (list of tokens) should be shown/visualized on the UI as a string and a tree (for AST part), and also for the input which can be obtained from user as in input field on UI created by JavaFX. Task 3.1: Implement a Lexer (9 points) A lexer turns the input string into a list of tokens. For example, it will turn the following expression mul 6 sub 4 sum 7 3 4 To the following array: ["mul", "6", "sub", "4", "sum", "7", "3", "4"1 t your Lexer based on the above description in Java. Task 3.2: Implement a Parser (9 points) A parser turns the list of tokens into an Abstract Syntax Tree(AST). Visually, the parsing is a process which turns the array: JavaFX (30 Points) You are required to develop a Lexical Analyzer (Lexer) and a Parser in Java and JavaFX. Show the output in GUI using JavaFX i.e., the output of the parser (Abstract Syntax Tree-AST) and lexer (list of tokens) should be shown/visualized on the UI as a string and a tree (for AST part), and also for the input which can be obtained from user as in input field on UI created by JavaFX. Task 3.1: Implement a Lexer (9 points) A lexer turns the input string into a list of tokens. For example, it will turn the following expression mul 6 sub 4 sum 7 3 4 To the following array: ["mul", "6", "sub", "4", "sum", "7", "3", "4"1 t your Lexer based on the above description in Java. Task 3.2: Implement a Parser (9 points) A parser turns the list of tokens into an Abstract Syntax Tree(AST). Visually, the parsing is a process which turns the array