Most programming languages support a number of Iterative and/or Recursive constructs, such as loops (e.g., For, While, Do…While, Loop…Until, Label…Return, Goto…Return, etc.) and recursion (e.g., recursive functions, recursive statements). Choose a programming language that supports at least one of the above, and specify the chosen programming language and the chosen construct. here I choose: (while...do loop of F# programming language) the question is : Design a Non-deterministic Finite Automata (NFA) for the syntax of the chosen construct above which is (while...do loop of F# programming language). with transition table for that. Note: that the NFA must cover the generic syntax of the construct, and not be limited to just a specific sample code. The syntax covers all valid code for the construct, hence the NFA must accept all valid code, whilst rejecting all invalid code.
Most
Choose a programming language that supports at least one of the above, and specify the chosen programming language and the chosen construct.
here I choose:
(while...do loop of F# programming language)
the question is :
Design a Non-deterministic Finite Automata (NFA) for the syntax of the chosen construct above which is (while...do loop of F# programming language). with transition table for that.
Note: that the NFA must cover the generic syntax of the construct, and not be limited to just a specific sample code. The syntax covers all valid code for the construct, hence the NFA must accept all valid code, whilst rejecting all invalid code.
Step by step
Solved in 2 steps