ComputerScienceExpert

(11)

$18/per page/

About ComputerScienceExpert

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Applied Sciences,Calculus See all
Applied Sciences,Calculus,Chemistry,Computer Science,Environmental science,Information Systems,Science Hide all
Teaching Since: Apr 2017
Last Sign in: 103 Weeks Ago, 3 Days Ago
Questions Answered: 4870
Tutorials Posted: 4863

Education

  • MBA IT, Mater in Science and Technology
    Devry
    Jul-1996 - Jul-2000

Experience

  • Professor
    Devry University
    Mar-2010 - Oct-2016

Category > Programming Posted 11 May 2017 My Price 8.00

Consider the language L consisting of all strings

Hi tutors, I have doing my revision for the end semester exam and I encountered some difficulties in talking the following questions. Help me out.

 

 

Question 1a)Consider the language L consisting of all strings w over the alphabet {a,b} such thatwcontains hhh or cccc (i.e., at least 3 b in sequence, or at least 4 a in sequence, orboth).For example, the strings ababbb, aaaaba, bbbaaaab, bbb, etc. belong to the language L.i)Construct a regular expression for Lii)Construct from the regular expression an NFA recognizing Liii)Construct a DFA recognizing L, either by deriving from the NFA of question (ii),or by constructing one directly.b)The following production rules represent a regular grammarS → aAA →aAA → bBB →bBB → εi)Determine the regular language defined by the above grammarii)List four strings of at least five terminals that can be accepted by the language)Question 2 (15 marks)a)Differentiate between recursive descent parsers and non-recursive descent parsersb)Consider the following grammar G:E →TE’E’→+TE’ |ET →FT’T’→*FT’ | εF →(E) | iWrite an implementation of the recursive parser by writing a procedure for each non-terminalc)Given the grammar G:E →E + TE →TT →T * F1

Attachments:

Answers

ComputerScienceExpert
(11)
Status NEW Posted 11 May 2017 02:05 AM My Price 8.00

-----------

Attachments

file 1494470060-Solutions file 2.docx preview (51 words )
H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly -----------onl-----------ine----------- an-----------d g-----------ive----------- yo-----------u e-----------xac-----------t f-----------ile----------- an-----------d t-----------he -----------sam-----------e f-----------ile----------- is----------- al-----------so -----------sen-----------t t-----------o y-----------our----------- em-----------ail----------- th-----------at -----------is -----------reg-----------ist-----------ere-----------d o-----------n -----------THI-----------S W-----------EBS-----------ITE-----------. ----------- Th-----------ank----------- yo-----------u -----------
Not Rated(0)