The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | May 2017 |
| Last Sign in: | 398 Weeks Ago, 4 Days Ago |
| Questions Answered: | 66690 |
| Tutorials Posted: | 66688 |
MCS,PHD
Argosy University/ Phoniex University/
Nov-2005 - Oct-2011
Professor
Phoniex University
Oct-2001 - Nov-2016
Prepare a meta-model of Backus-Naur (BNF) representations of computer languages. A compiler-compiler (such as UNIX program YACC) could use the model. The compiler-compiler accepts these representations in graphical form as inputs and produces a compiler for the represented language.
In a Backus-Naur form rectangles denote non-terminals, circles for rectangles with rounded corners to note terminals. Single characters are in circles and sequences of several characters are and rounded rectangles. Arrows indicate the direction of follow through the diagram. Where several directed pabst diverge, it's permissible to take anyone of them. The name of non-terminal being described appears at the beginning of its representation.
Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll