Timeline for Parsing random phrases from a file
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 13, 2014 at 4:52 | history | edited | Jamal | CC BY-SA 3.0 |
deleted 75 characters in body; edited tags; edited title
|
| Apr 27, 2011 at 20:23 | history | edited | Mr_CryptoPrime | CC BY-SA 3.0 |
deleted 935 characters in body
|
| Apr 27, 2011 at 20:20 | vote | accept | Mr_CryptoPrime | ||
| Apr 27, 2011 at 8:16 | answer | added | RoToRa | timeline score: 5 | |
| Apr 27, 2011 at 7:13 | comment | added | RoToRa | Your sample file doesn't correspond with the what the program is parsing. The program is obviously looking for curly brackets, which are missing. | |
| Apr 27, 2011 at 6:00 | history | tweeted | twitter.com/#!/StackCodeReview/status/63120300111446016 | ||
| Apr 27, 2011 at 4:52 | comment | added | Mr_CryptoPrime | Yes, unfortunately my teacher did not disclose the sample size or the grammar file that is to be run...Thanks for trying to help though, appreciate it! :) | |
| Apr 27, 2011 at 4:29 | comment | added | user unknown | If you ask performance questions, you should mention a) what machine you're running on, b) how fast it is now and how fast it has to be. c) What is the sample size? Solutions which are fast with 1000 elements might perform poorly with 1000000 elements. d) Then you have to do some measurements with a profiler, which tells you, where the most amount of time is spent. | |
| Apr 27, 2011 at 0:21 | history | asked | Mr_CryptoPrime | CC BY-SA 3.0 |