Phoenix - Your AI AssistantWrite code to build one of the compiler units : LL(1) Parsing in c#
- Posted:
- Proposals: 2
- Remote
- #1163483
- Expired
have already sent a proposal. Description
Experience Level: Intermediate
General information for the business: Compiler software building
Kind of development: New program from scratch
Num. of modules: 5
Description of every module: Implement utilities for LL(1) parsing:
a) A function LeftFactor which left-factors a given CFG.
b) A function LeftRecElim which eliminates left recursion from a given CFG. (Assume the
CFG has no "-rules and no cycles.)
c) A function First which computes the First set for all terminals and variables of a given
CFG.
d) A function Follow which computes the Follow set for all variables of a given CFG.
e) A function Table which constructs the LL(1) parsing table for a given CFG.
Description of requirements/functionality: a) A function LeftFactor which left-factors a given CFG.
b) A function LeftRecElim which eliminates left recursion from a given CFG. (Assume the
CFG has no "-rules and no cycles.)
c) A function First which computes the First set for all terminals and variables of a given
CFG.
d) A function Follow which computes the Follow set for all variables of a given CFG.
e) A function Table which constructs the LL(1) parsing table for a given CFG.
Specific technologies required: c#
OS requirements: Windows
Extra notes:
Kind of development: New program from scratch
Num. of modules: 5
Description of every module: Implement utilities for LL(1) parsing:
a) A function LeftFactor which left-factors a given CFG.
b) A function LeftRecElim which eliminates left recursion from a given CFG. (Assume the
CFG has no "-rules and no cycles.)
c) A function First which computes the First set for all terminals and variables of a given
CFG.
d) A function Follow which computes the Follow set for all variables of a given CFG.
e) A function Table which constructs the LL(1) parsing table for a given CFG.
Description of requirements/functionality: a) A function LeftFactor which left-factors a given CFG.
b) A function LeftRecElim which eliminates left recursion from a given CFG. (Assume the
CFG has no "-rules and no cycles.)
c) A function First which computes the First set for all terminals and variables of a given
CFG.
d) A function Follow which computes the Follow set for all variables of a given CFG.
e) A function Table which constructs the LL(1) parsing table for a given CFG.
Specific technologies required: c#
OS requirements: Windows
Extra notes:
New Proposal
Login to your account and send a proposal now to get this project.
Log inClarification Board Ask a Question
-
There are no clarification messages.