Editing Talk:1678: Recent Searches

Jump to: navigation, search
Ambox notice.png Please sign your posts with ~~~~

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 28: Line 28:
 
:Sort of. In computing, it's a little more specific, though, referring to functions that call themselves as part of their normal running. This in turn has led to the idea of recursive definitions, that of course refer to the original word. Example: "recursion: see recursion."
 
:Sort of. In computing, it's a little more specific, though, referring to functions that call themselves as part of their normal running. This in turn has led to the idea of recursive definitions, that of course refer to the original word. Example: "recursion: see recursion."
  
βˆ’
:I take issue with the explanation for another reason, though. True, regexes probably can't be used to check the validity of EBNFs. It's a little bit more complicated than that, though. If one has ever used a compiler-compiler like yacc (which, supposedly uses EBNF grammars or EBNF-like grammars), another tool in the Unix world comes to mind, awk. Awk is similar enough in design to a cc that it can do the job of one, and people have apparently made compilers in awk. And what does awk use for its pattern matching? Regexes. Exercise for the reader: Write an EBNF for EBNFs. :D. [[User:Tibfulv|Tibfulv]] ([[User talk:Tibfulv|talk]]) 17:49, 10 May 2016 (UTC)
+
:I take issue with the explanation for another reason, though. True, regexes probably can't be used to check the validity of EBNFs. It's a little bit more complicated than that, though. If one has ever used a compiler-compiler like yacc (which, supposedly uses EBNF grammars or EBNF-like grammars), another tool in the Unix world comes to mind, awk. Awk is similar enough in design to a cc that it can do the job of one, and people have apparently made compilers in awk. And what does awk use for its pattern matching? Regexes. [[User:Tibfulv|Tibfulv]] ([[User talk:Tibfulv|talk]]) 17:49, 10 May 2016 (UTC)
  
 
:: If you allow recursive regexes, it *is* possible to match EBNF with a regex: http://forums.xkcd.com/viewtopic.php?f=7&t=115494&p=3974658#p3974278 [[Special:Contributions/162.158.68.5|162.158.68.5]] 19:38, 10 May 2016 (UTC)
 
:: If you allow recursive regexes, it *is* possible to match EBNF with a regex: http://forums.xkcd.com/viewtopic.php?f=7&t=115494&p=3974658#p3974278 [[Special:Contributions/162.158.68.5|162.158.68.5]] 19:38, 10 May 2016 (UTC)

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)

Template used on this page: