Timeline for Language Design: 2-D Pattern Matching
Current License: CC BY-SA 3.0
31 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 8, 2018 at 11:41 | comment | added | matanox | Late to the party, I'm looking for an API or interactive user interface for very lightweight python programmers, that they can be taught use instead of regular expressions. Would you particularly recommend any of this contest's implementations? the target audience are researchers who do not need to become programmers, but do not to work on extracting surface-form stuff from texts for some of their research. Regex is just too obtuse for such audience. | |
| Oct 28, 2015 at 12:39 | history | edited | Martin Ender | edited tags | |
| Apr 4, 2015 at 16:48 | comment | added | Sp3000 | Bit late, but I feel like collinear points could do with a test case where the distance between hash A and hash B isn't a multiple of the distance between hash C and hash D, e.g. #...#..#. Also, it'd be interesting to have more than three hashes in a line :) | |
| Mar 17, 2015 at 13:18 | answer | added | Zgarb | timeline score: 16 | |
| Mar 8, 2015 at 23:14 | answer | added | BMac | timeline score: 32 | |
| Mar 8, 2015 at 22:56 | answer | added | Stretch Maniac | timeline score: 10 | |
| Mar 7, 2015 at 18:39 | comment | added | Martin Ender | @Ell Without an implementation it seems hard to judge whether the design actually works as advertised (both for you and others). Since this question isn't likely to hit HNQ anyway at this point, I don't think you lose anything by holding off the post until you've got at least a working prototype. If you want to share the design to get feedback, you're welcome to do so in the chatroom linked at the top of the challenge. :) | |
| Mar 7, 2015 at 18:34 | comment | added | Ell | @MartinBüttner @ PhiNotPi Will it be ok to post the spec first and add the implementation later? I'd rather not write a rushed implementation. | |
| Mar 7, 2015 at 15:59 | answer | added | Sp3000 | timeline score: 23 | |
| Mar 7, 2015 at 14:54 | history | edited | Martin Ender | CC BY-SA 3.0 | added 150 characters in body |
| Mar 7, 2015 at 14:53 | comment | added | Martin Ender | @Ell For the nether portal, it's enough to match the interior, because the borders might overlap. If your language supports overlapping matches, feel free to include the borders. For the boggle problem, I'd leave that up to what your language can handle. | |
| Mar 7, 2015 at 14:47 | comment | added | Ell | @MartinBüttner @PhiNotPi In the nether portal problem, can you clarify what part of the input should be matched (the obsidian? the enclosed space?) In the Boggle problem, can the same character be used twice in a row (e.g., does the input A contain the word AA?) | |
| Mar 7, 2015 at 12:58 | history | edited | Martin Ender | CC BY-SA 3.0 | added 62 characters in body |
| Mar 6, 2015 at 17:06 | history | edited | PhiNotPi | CC BY-SA 3.0 | added 81 characters in body |
| Mar 6, 2015 at 14:52 | answer | added | Logic Knight | timeline score: 14 | |
| Mar 6, 2015 at 11:47 | answer | added | feersum | timeline score: 18 | |
| Mar 4, 2015 at 13:07 | history | edited | Martin Ender | CC BY-SA 3.0 | added 188 characters in body |
| Mar 4, 2015 at 13:06 | comment | added | Martin Ender | @luserdroog Yes it's a alive and well (I see you've already found it, but others might be interested, too). | |
| Mar 4, 2015 at 8:36 | comment | added | luser droog | Is the chatroom for this question still open/active? I've got some ideas I want to throw out, but it's not really complete. | |
| Mar 4, 2015 at 2:58 | history | tweeted | twitter.com/#!/StackCodeGolf/status/572954203628421120 | ||
| Mar 3, 2015 at 23:10 | history | edited | Doorknob | CC BY-SA 3.0 | minify html |
| Mar 3, 2015 at 21:56 | comment | added | mbomb007 | @MartinBüttner In that case, I'd like to give it a go. If I succeed or get close, I'll probably want help improving efficiency or with suggestions after the fact, since I'm only an intermediate-level programmer in Python. I tried to understand the Python interpreter for FlogScript, and I didn't get very far. | |
| Mar 3, 2015 at 21:47 | comment | added | Martin Ender | @mbomb007 Yes, exactly that. You need to write a parser for the language and then process some input text block based on what you parsed. | |
| Mar 3, 2015 at 21:44 | comment | added | mbomb007 | @MartinBüttner I don't even know how to create a language, really. Could it be something as (simple?) as creating a Python program that takes a file of your new language's code (and interpreting/executing it based on your defined syntax) and producing output? | |
| Mar 3, 2015 at 21:42 | comment | added | Martin Ender | @mbomb007 There are bonus points for creating a 2-D language. I'm pretty sure it would get a decent amount of upvotes. ;) | |
| Mar 3, 2015 at 21:36 | comment | added | mbomb007 | Looks interesting, especially since you created a new tag for this. I think there should be bonus points for creating a 2-D language for it. | |
| Mar 3, 2015 at 20:42 | comment | added | PhiNotPi | @DevonParsons There is no entry deadline. | |
| Mar 3, 2015 at 20:38 | comment | added | Devon Parsons | Is there a general time limit on these problems? I'm very interested in solving this but I'm very busy, it could easily take me 2 weeks to do. | |
| Mar 3, 2015 at 19:52 | history | edited | Martin Ender | CC BY-SA 3.0 | added 97 characters in body |
| Mar 3, 2015 at 19:23 | history | edited | Martin Ender | CC BY-SA 3.0 | deleted 25 characters in body |
| Mar 3, 2015 at 19:22 | history | asked | PhiNotPi | CC BY-SA 3.0 |