2
$\begingroup$

Is it possible to parse all kinds of structured data and give them a semantic meaning? For example, C++ is a really complicated language and I could never imagine a parser would be possible for it.

What makes a certain grammar parse-able and contain semantics? How do I decide a written information is parse-able?

| cite | improve this question | | | | |
$\endgroup$
  • 1
    $\begingroup$ If it were impossible to parse C++, how would it be possible to compile programs written in C++? $\endgroup$ – rici Sep 22 '18 at 11:14
  • $\begingroup$ Right, but how do you know before you ever attempt to design? $\endgroup$ – nmd_07 Sep 22 '18 at 11:28
  • $\begingroup$ Can you define what "parse-able" means for you? (For instance, under what circumstances would a grammar not be parse-able? How could that happen?) $\endgroup$ – D.W.♦ Sep 22 '18 at 16:30
  • 1
    $\begingroup$ The techniques necessary to parse C++ have been known for decades. I suggest taking a class on compilation theory. $\endgroup$ – Yuval Filmus Sep 22 '18 at 17:21

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.