« first day (2242 days earlier)      last day (2592 days later) » 

2:00 AM
there should really be a hide setting
 
@Mendeleev SPACE EXISTS!
You can pause
 
@JanDvorak although, it doesn't show your username
it shows your profile name
 
There should, but it would "increase code complexity and slow down the browser"
@Maltysen semantics at best
 
@JanDvorak no, because if someone knew your username, they basically know your email, your profile name is usually just your IRL name
or just something stupid
 
My IRL name is . as far as Chrome is concerned :-)
 
2:02 AM
.* FTFY
 
rolls back Mistah's edit
 
lel
trying to make the button really small?
 
I think my name is pretty well known at this point, although most don't seem to be sure if it's fake or not.
 
@ATaco William Lemon?
 
@ATaco Yes you are tehFlaminTaco
 
2:03 AM
^^ Yeah.
That too.
 
wait really
wow
How could your parents be so cruel?
 
What, by being named "Lemon"? It's just a surname.
 
@Maltysen It's a workaround
 
> me: Yes you are tehFlaminTaco
> you: Yeah
 
>Oh
Double Caret to the rescue!
 
2:06 AM
^^
 
@ConorO'Brien TIL conor is skynet or something
 
Probably.
 
@ConorO'Brien yes, then goats and dragons can roam free :D
 
@DestructibleLemon It's from an alternate timeline in which John made a truce with the machines to save his ... life.
 
@Downgoat \o/
 
user165474
2:08 AM
Question: Who here has TNB in their bookmarks?
 
@DestructibleLemon you have neither seen nor heard anything
 
I guess I am excluded because lemons are sessile
 
@HyperNeutrino me
 
@HyperNeutrino I don't. I just type "n" and the nineteenth byte comes up in my suggestions.
 
2:08 AM
I just type in the URL.
 
not me but I just type nin
 
240 isn't hard to remember.
 
I don't use bookmarks.
 
@HyperNeutrino Surprisingly not, even though I have like 100 or something
 
user165474
2:08 AM
@ConorO'Brien For me, "n" gives me noteflight.com at first
 
I'm on a work machine, I'm surprised they don't notice my Projects folder.
 
I do have PPCG bookmarked, and open TNB every time I open that
 
user165474
I have it bookmarked but I hardly ever use it, I just type Nineteen and look for it
 
Anyways... time to head to bed for three hours of sleep. I need to be fit in the morning.
 
Someone needs to set up a URL to redirect to TNB, like talk.tryitonline.net
 
user165474
2:10 AM
@ATaco I can remember the components of the URL but I can't remember which order the things go in
 
speaking of redirects, ppcg.lol went down :(
 
@Maltysen ppcg.ga
 
@Mendeleev :D
thanks!
 
user165474
@JanDvorak You need 3 hours? I only need -6 hours per night! ^_^ just kidding, good night!
 
Who maintains that link?
 
2:11 AM
is there a cpp domain?
 
user165474
@Mendeleev Even better! Thanks!
 
or better a gcpp domain
 
user165474
Unfortunately, ppcg.ga can't be used except to access the mainpage because it redirects all requests to the index
 
curl ppcg.ga gives... nothing?
 
user165474
? that's weird, not even an error
 
2:14 AM
@ГригорийПерельман you need -L
to follow redirs
 
user165474
Python requests works
 
user165474
@Maltysen Oh, I didn't know that either thanks
 
@Maltysen I don't want to follow the redirect, I want to see what the code being used for the redirect is >_>
 
@ГригорийПерельман it's a server side thing, the server sends a 301
 
CMC: Given N output the Nth term of this sequence: [-1 2 -2 1 -3 4 -4 3 -5 6 -6 5 -7 8 -8 7 ...] (0 or 1 indexed as you like)
 
2:20 AM
What's tha pattern
nvm I see it now
 
1 2 2 1, 3 4 4 3, 5 6 6 5, etc except signs alternate
(will post as real challenge if response good here)
 
user165474
@Helka lambda n:[-n/2-1,n/2+[2,0][n%4-1]][n%2] needs to be tested, really naive approach, 0-indexed
 
user165474
(python 2)
 
user165474
yeah nope it doesn't work
 
super naive
 
2:27 AM
^_1
 
user165474
lol mine failed completely
 
@Maltysen doesn't work?
 
please help
my pilot died already
 
@Maltysen 0 is error, 1 outputs zero, 2, everything else seems fine
 
@DestructibleLemon shit didn't do edge cases
 
2:28 AM
"edge" cases
 
user165474
@DestructibleLemon Nice name change
 
thank you
 
user165474
but it's kinda eye-painful tbh imho
 
I'm very tempted to make a worse one
 
nm I upgraded my medbay got it to heal everyone then sent two people into oxygen to repair it, then sent them back, they survived
should I buy clone bay, or scrap recovery arm
or upgrade ship
 
2:34 AM
@HyperNeutrino Me (I have a nickname for the bookmark so I just have to type c + Enter)
 
user165474
Oh nice, that sounds like a convenient shortcut.
 
But that's only because I use a very uncommon browser (Vivaldi)
 
@ASCII-only what is it?
I would not consider Vivaldi "weird"
 
0
A: Sandbox for Proposed Challenges

BijanSimulate Ranked Ballots You live in a town with c citizens, and m mayoral candidates. The candidates are numbered from 0 to m-1, or 1 to m. Please state whether you are using 0 indexing or 1 indexing. People have submitted votes, and it is your job to determine who won. The rules are that every...

 
@Mendeleev It's a minuscule share of browsers
like .03% or something can't remember
 
2:44 AM
@quartata I know, but it's based on Blink/Chrome
 
Well SeaMonkey is Gecko and everyone called me weird when I used it
Those were the days
 
@HelkaHomba RProgN2
Flags are just for debug information, and aren't needed.
 
@HelkaHomba Stacked, 59 bytes Try it online!
 
@ATaco What does --e do?
 
can be shorter using the previously mentioned tactic
 
2:51 AM
Writes Java Errors to STDERR
 
@ConorO'Brien what is this
 
That seems like something you want always on.
 
@DestructibleLemon it's a program
 
oh the second elements are the ones
How do you input N?
 
0
Q: Up, Down, Odd, Even

Helka HombaGiven N, output the Nth term of this infinite sequence: -1 2 -2 1 -3 4 -4 3 -5 6 -6 5 -7 8 -8 7 -9 10 -10 9 -11 12 -12 11 ... etc. N may be 0-indexed or 1-indexed as you desire. For example, if 0-indexed then inputs 0, 1, 2, 3, 4 should produce respective outputs -1, 2, -2, 1, -3. If 1-index...

Simple but why not
 
2:53 AM
@DestructibleLemon it's a function
 
{! ... } is an n-lambda
 
My friends all think I'm too odd :/
 
Is the 'Challenges of the Day' part of the Userscript broken for anyone else?
 
the userscript is entirely broken for me
4
A: Default for Code Golf: Input/Output methods

ETHproductionsFunctions may return a function that returns the result This is very similar to currying, the only difference being that there is only one argument. Sometimes it's useful to curry a recursive function that has only one argument, especially if that argument doesn't need to be modified to find the...

this is at +8/-4, I think that meets consensus?
 
3:07 AM
:| oops did i use a feature firefox doesn't have
What does the console say
 
@ConorO'Brien think that +10/-4 is good enough.
 
@ATaco beat you by 1 byte :)
 
Working on an new version already.
 
3:27 AM
@ConorO'Brien Outgolf'd by 3.
 
hmm I'll see what I can do
 
3:40 AM
@EriktheOutgolfer Your name sounds badass
 
@ATaco hehehehe
oh wait nvm
 
4:15 AM
@ConorO'Brien Stole another 3 bytes from Pip.
 
:36149654 You know, you can use the sandbox to test things.
 

Sandbox

Where you can play with chat features (except flagging) and ch...
 
4:57 AM
0
Q: Compute the most efficient binary function

isaacgToday, we'll be computing the most efficient binary function. More specifically, we'll be computing the function which, when an equation is created from applying the function to the constant input 0, can represent all positive integers with the shortest possible expressions, placing higher priori...

 
5:18 AM
Why is this a "must have" extension?
 
What does that even mean?
 
@feersum I think it helps you see if you have Google Analytics, etc. correctly installed.
 
To what does "tag" refer?
 
@feersum HTML tag?
 
5:35 AM
nice chain of starred messages here
 
@ГригорийПерельман Depends on what you mean with that. Röda uses a handmade recursive descend parser, specifically an LL(2) parser with some extra twists. And btw, the #! comments are actually allowed in Röda.
 
5 hours ago, by mınxomaτ
user image
 
@JanDvorak did not see that
 
6:00 AM
How? It has 11 stars...
 
Anonymous
@Riker No starboard on mobile
 
True
 
doesn't explain this case
 
Anonymous
Random imgur link isn't terribly useful either. One has to actually click on it to see the image.
 
@Mendeleev do you have a steam:// link? or what's the game called?
I have steam app but website is blocked rn
 
6:06 AM
@Mego the same fate will be shared by any new copy of the image
 
@Riker Into the Breach
 
K searchibg
Looks cool enough
m.imgur.com/gallery/O89H1 it's like 4chan naming mtn dew all over again [some bits are nsfw]
 
Anonymous
6:28 AM
You should probably mention that most of the names are NSFW. Or maybe you shouldn't have posted it at all.
 
6:42 AM
0
Q: Make it easier to post answers on Sandbox from Mobile App?

Patrick RobertsMaybe I'm missing something, but is there an easy-ish way to initiate the process of writing an answer in the Sandbox from the mobile app? I noticed the phrase "bottom of the page" in the sandbox question was a link and I clicked on it, only to be brought recursively to the question, so I don't t...

 
 
1 hour later…
7:56 AM
@DJMcMayhem cat + orisa m.imgur.com/gallery/ebd7X
 
8:17 AM
@Riker omg, don't know if this is real, but in either case this guy has way too much time on his hands XD
his comments on astronomy / nasa articles are the best.
 
0
A: Sandbox for Proposed Challenges

AdámEvaluate a simple spreadsheet Cell references are of the form A2 or R1C2, optionally with any single character pre- or suffix. The spreadsheet will at most have 9 rows and columns. There are no circular references or formula errors. Empty cells are one of nulls, empty strings, empty lists, etc....

 
@flawr ikr
 
8:48 AM
0
Q: Does Super Mario World count as a programming language?

Matthew RohSome time ago, YouTube user Sethbling has injected code into Super Mario World, and I am planning to make a challenge about it (Making pong, to be exact). But, I should know first if it counts as a programming language. Does it count as a programming language? If it does, How would we score the...

 
9:01 AM
How would I go about making a parser library?
 
0
A: Sandbox for Proposed Challenges

GLASSICOutput Haftseen table items - in Persian/Arabic characters Theme : Jalali New Year 1397 Main Goal : Displaying non-ASCII characters correctly Introduction A typical Haftseen table consists 7 items which their names start with س (pronounced like S) and some additional items. It is set few days...

 
9:43 AM
I have a chess puzzle idea (copied from the internet) if anyone is interested
hi.. can anyone help me compile codegolf.stackexchange.com/a/113334/9206 ?
does it compile for anyone here?
 
9:59 AM
 
This cpu's on fire
 
10:13 AM
:)
 
@TuxCopter How is that thing cooled @ 9GHz?
 
it will be when you put it inside a German computer
 
@Adám Cryogenic fluid?
 
Goat blood, with candles for lighting?
 
10:19 AM
well, I guess you do need to sacrifice some goats to overclock your CPU at 9GHz
 
@ConorO'Brien can you ping me when the docs are complete? :)
 
10:38 AM
I kinda want to implement a parser in Clojure, similar to PegJS
But I have no idea where to start
 
@Qwerp-Derp wikiwand.com/en/Recursive_descent_parser There is a C example of a LL(1) parser
It could help you
 
Why Wikiwand tho
 
bcuz it's good
 
Would top-down be easier?
I'm not really developing a separate "language" for parsing stuff, I just want to add on to Clojure (i.e. make functions and stuff)
 
@MartinEnder will do!
 
10:52 AM
(def-grammar test-lang
  [(def-rule Word
    [{:word #"[A-Za-z]+}]
    [:word])
   (def-rule Number
    [{:num #"[0-9]+"}]
    [(read-string :num)])])
So probs something like this
 
-1
Q: Programming Code for 16-Bit data transmission and reception

SarasCan anyone help me in coding section, how to transfer 16 bit (binary bits), and i should get the output (16 binary bits) same as input. I used IF statement for execution. But its not working. Is it possible to transfer 16 bit and to get the output same as input. Which Loop is best ? to start th...

 
@NewMainPosts what are they asking exactly... ?
 
It's not a programming challenge, that's for sure
 
From what I understand they are asking how to do print(input())
 
@TuxCopter I honestly don't know, this question would be closed immediately
I should honestly just be harsh since I know that the person won't reply
 
11:04 AM
yesterday, by New Meta Posts
0
Q: "Be Nice" applies to off-topic questions too

DJMcMayhemFor whatever reason, PPCG tends to get a lot of off-topic questions, generally about code-troubleshooting. Maybe it's because our help-center is inaccurate. Or maybe it's simply because we're a large-ish site with a lot of activity but very few questions per day, so each off-topic question is mor...

 
@JanDvorak Yeah yeah I know, I refrained from doing that
But I honestly don't have the patience anymore for those questions
 
@Qwerp-Derp no reason to be harsh when you can be nice
 
@ConorO'Brien I'm just annoyed at these questions, that's all - it's clear that this person hasn't put any information, it makes it really hard to solve anyway. The poster usually ignores the question once they post it as well.
It just looks like the person hasn't put any thought into the question at all (which may or may not be the case).
 
TBH we do expect a higher quality of questions (generally) being on the SO network, a higher-quality Q&A site (as opposed to Yahoo Questions, or Quora)
 
Okx
New users < 50 rep should get a warning when posting a question here... should that be on codegolf.meta.stackexchange.com/questions/8350/…?
 
11:11 AM
I think that's a bad idea, considering that we won't have custom changes for a while, and, depending on the warning, it can still be rather harsh. I say we deal with bad questions as they come, like other sites before us have.
 
Said warning could just point them to the sandbox. That could be useful.
 
And say that general programming questions should go on SO
 
Okx
It could just be a link to codegolf.stackexchange.com/help/on-topic
 
most of them shouldn't, though
 
Okx
and say that we get a lot of off-topic questions from new users, and say sorry if this is an inconvenience
 
11:15 AM
do we actually have a problem with too many poor questions?
 
Yes
 
I don't think we do
 
Okx
16/50 of the newest questions are closed
 
We're getting rid of them quite efficiently
 
Okx
Looking at the help center is funny at times codegolf.stackexchange.com/help/product-support (relevant meta answer codegolf.meta.stackexchange.com/a/8354/26600)
"We get a lot of requests from product teams about how they can use Programming Puzzles & Code Golf Stack Exchange to support their communities" sure we do
 
11:27 AM
my only comment is that open source projects survive if they are open and welcoming to new and inexperienced members
 
"I got this error, why? -- ask on Programming Puzzles & Code Golf Stack Exchange" yes pls
 
I guess that explains why Yahoo Answers still exists and thrives
 
0
Q: Dancing arrays. Output them with some forward-backward moves

Roman BruhanovThe task is to create a program (or a function), which outputs array elements in the order, determined by two numbers F and B. F is number of elements to print, B is the rollback distance (from last printed element). Each element must be printed on separate line and blank line must be inserted a...

 
11:42 AM
0
Q: Find first 2 integers from an un-ordered list that sum to a given integer

philcolbournI came across this google Interview question 1 recently. Perhaps, I thought, it would make an interesting Code Golf exercise. Find first 2 integers from an un-ordered list that sum to a given integer. In the video, the 'interviewer' changed requirements several times, but I'll fix requirements...

 
do you think it's possible to write code to find the smallest number of legal moves to get to i.stack.imgur.com/FrGP2.jpg ?
 
As long as you don't require any guise of a reasonable runtime, sure
 
@Downgoat Is the PPCG redesign script borked?
 
@JanDvorak how about a reasonable runtime?
 
Then no.
 
11:48 AM
@JanDvorak Well.. what I mean is that it's a challenge. So the smaller the number of steps the better
or do you think you can't find any sequence of legal moves to get to that position?
 
that wouldn't be a programming challenge though
 
@JanDvorak sure it would!
it's an optimization challenge
you have to write code that optimizes this question
the score is the number of steps. The smaller the better
 
Those black pawns are way outside their starting ranks
 
yes
 
I'd expect answers to just hardcode the sequence of moves
 
11:51 AM
I think that's outside of our rules isn't it? Normally we require that the code actually computes the answer
 
There's a sliding scale of hardcodedness.
 
yes
but we have had lots of successful challenges where you could cheat like that if you really wanted. It helps a lot that an optimal solution seems very hard to find
 
user165474
12:09 PM
Question: I created a bounty for a specific answer because I thought their use of regex for that challenge was absolutely astounding (+50), and then another user made a shorter regex answer. My thoughts on this are that I would still like to reward the original user for the original and creative solution, but the newer solution is shorter and thus wins based on OP's criterion. Which user should I give it to when the time comes?
 
user165474
2
A: Calculate Phi (not Pi)

Martin EnderRegex (.NET), 88 86 bytes ^(?=((?=(..+)\2+$)?.)+)(?=(?<-2>.)*(.+))(?=(((?!(..+)\6*(?<=^\6+)\3$))?.)*\3)(?<-5>.)* Try it online! (As a Retina program.) Uses the same I/O as n̴̖̋h̷͉̃a̷̭̿h̸̡̅ẗ̵̨́d̷̰̀ĥ̷̳ 's answer, i.e. unary input and it matches a substring of the length of the result. It migh...

 
user165474
(This is the new answer)
 
Okx
12:19 PM
He might've been inspired by n̴̖̋h̷͉̃a̷̭̿h̸̡̅ẗ̵̨́d̷̰̀ĥ̷̳, so I would still award it to him
 
user165474
Okay. That's what I was thinking. Thanks. I'll see if anyone else has any other thoughts on it.
 
@HyperNeutrino it's your rep, you can give the bounty to whichever answer you like
 
Okx
He knows that, but he's asking which answer he should give it to
 
I was under the impression that they prefer the old answer but feel an obligation to assign it to the new one because it's shorter (which they shouldn't).
 
Okx
ah
 
user165474
12:28 PM
@MartinEnder Okay, thanks. I read this Meta answer and it seems to be saying about the same things.
 
@MartinEnder Do you think an optimization challenge to find the smallest number of legal moves to get to i.stack.imgur.com/oFP4V.png is off topic for ppcg?
maybe with a time limit?
 
@Lembik depends on how likely it is that it will be solved optimally
well, it's on topic either way, but it might not be well-received if the first answer kills the challenge
 
@Riker Ahahaha.
 
@MartinEnder true... I suspect it is hard but it's hard to know
@MartinEnder I know... the sandbox will tell me :)
@MartinEnder Do I have to set a time limit? I would like to avoid making people run the code on my machine if possible
 
12:49 PM
not necessarily. without a time limit you could also consider posting this on puzzling instead though.
 
@MartinEnder it's too hard for them :)
 
that seems a bit condescending?
 
@MartinEnder It was meant to be a joke about how great ppcg is. In fact it is already there I see
it's a famous problem
 
1:48 PM
woohoo, new Crafting Interpreters chapter is out
 
@ETHproductions is the PPCG userscript broken
 
It is for me, not sure why
 
@MartinEnder I ended up not following that book when writing my compiler because I realized how much I didn't want to write my own parser :P
 
@NathanMerrill does it use parser generator?
 
Antlr4 :)
I can post my grammar if you are interested. It's nowhere near complete, but I've got expressions, and a good amount of constructs
 
2:01 PM
Does antlr parse all CFGs?
 
I have no idea, I couldn't prove it, but I've had no problem using it so far :)
 
So it's not like a LALR where you get 500 conflicts after making grammar
 
well, the first time I used it, I didn't understand how it worked, so I wrote a ton of bad grammar
they key, I learned, was writing good tokens. After you've written your tokens, putting them together was pretty simple
 
Oh so antler supports tokenizer?
 
you have to split it up into tokens and statements
for example, my set syntax was s[1,2,3]
 
2:07 PM
10/19 sounds great
 
initially my grammar was S + OPEN_BRACE + comma_list + CLOSE_BRACE
(uppercase is token, lowercase is rules)
but the problem is that made a variable with the name of s impossible
 
Oh I see
 
but I changed it so that OPEN_SET = s[
 
You could do s[ as the token
 
right
 
2:09 PM
Ninja'd :P
 
gist: a370ea47442e374e7db3dd21c472c7fc, 2017-03-20 14:10:01Z
grammar Elegance;

prog:  eleStatement* EOF;

eleStatement: (e_class | function | assignment | function_call) ;

e_class :
    CLASS_DECLARATION IDENTIFIER parameter_list? 
    type_parameters? 
    OPEN_CURLY 
    eleStatement*
    CLOSE_CURLY;

function:
    FUNCTION_DECLARATION IDENTIFIER parameter_list 
    COLON type 
    OPEN_CURLY 
    eleStatement*
    CLOSE_CURLY;

assignment:
    (VALUE_DECLARATION | VARIABLE_DECLARATION | OPTION_DECLARATION)? IDENTIFIER 
    (COLON type)? 
    EQUAL 
    (expression);

function_call: expression argument_list;

argument_list:
    OPEN_PAREN 
       (argument
           (COMMA  argument)* 
           (COMMA  named_argument)* 
       | named_argument
           (COMMA  named_argument)* 
       )?
   CLOSE_PAREN;

argument: expression;

named_argument: IDENTIFIER EQUAL expression;

parameter_list:
    OPEN_PAREN 
        (parameter
            (COMMA  parameter)* 
        )?
    CLOSE_PAREN;

parameter:
    expression 
    (COLON type)?;

type_parameters:
    OPEN_ANGLE_BRACKET 
        IDENTIFIER 
        (COMMA  IDENTIFIER )*
    CLOSE_ANGLE_BRACKET ;

type_arguments:
    OPEN_ANGLE_BRACKET
        IDENTIFIER 
        (COMMA  IDENTIFIER )*
    CLOSE_ANGLE_BRACKET ;

trait_argument: IDENTIFIER (EQUAL INTEGER)? ;

trait_arguments:
    OPEN_BRACKET 
        trait_argument
        (COMMA  trait_argument)* 
    CLOSE_BRACKET;

type: IDENTIFIER  type_arguments?  trait_arguments? ;

expression:
        expression  PERIOD IDENTIFIER |
        expression argument_list |
        expression OR  expression |
        expression AND  expression |
        expression (IS | EQ | NEQ)  expression |
        expression (LEQ | GEQ | LT | GT)  expression |
        expression (PLUS | MINUS)  expression |
        expression (MULT | DIV)  expression |
        OPEN_PAREN  expression  CLOSE_PAREN |
        literal |
        IDENTIFIER;

literal: INTEGER | FLOAT | list | tuple | dictionary | set | STRING ;

list: OPEN_BRACKET  (expression (COMMA  expression)* )? CLOSE_BRACKET ;

tuple: TUPLE_START  (expression (COMMA  expression)* )? CLOSE_BRACKET ;

set: SET_START  (expression (COMMA  expression)* )? CLOSE_BRACKET ;

dictionary: DICT_START  (expression COLON expression (COMMA  expression COLON expression)* )? CLOSE_BRACKET ;

INTEGER: '0' | ('+' | '-')? [1-9][0-9]* ;

FLOAT: ('0' | ('+' | '-')? [1-9][0-9]* ) '.' [0-9]+;

STRING: '"' ('\\'. | ~('"' | '\\'))* '"' |  '\'' ('\\'. | ~('\'' | '\\'))* '\'';

SET_START: 's[';
TUPLE_START: 't[';
DICT_START: 'd[';


CLASS_DECLARATION : 'class' ;
FUNCTION_DECLARATION: 'fun' ;
VALUE_DECLARATION: 'val' ;
VARIABLE_DECLARATION: 'var' ;
OPTION_DECLARATION: 'option' ;

OPEN_CURLY: '{' ;
CLOSE_CURLY: '}' ;
OPEN_PAREN: '(' ;
CLOSE_PAREN: ')';
OPEN_ANGLE_BRACKET: '<' ;
CLOSE_ANGLE_BRACKET: '>';
OPEN_BRACKET: '[' ;
CLOSE_BRACKET: ']' ;


COLON: ':' ;
COMMA: ',';
PERIOD: '.' ;

EQUAL: '=';

OR: 'or';
AND: 'and';
IS: 'is';
EQ: 'eq';
NEQ: 'neq';
LEQ: 'leq';
GEQ: 'geq';
LT: 'lt';
GT: 'gt';

PLUS: '+';
MINUS: '-';
MULT: '*';
DIV: '/';

IDENTIFIER: [a-zA-Z_][a-zA-Z0-9_]*;

UNDERSCORE: '_';

WS: ('\n' | '\r' | '\t' | ' ')+ -> skip;
 
@NathanMerrill if I write an ambiguous grammar in ANTLR will it give me all possible parsings?
 
no.
if you are talking about ambiguous tokens (like for example, IDENTIFIER and OR)
the one that is defined first always wins
which means that an identifier can never be or
I believe first-wins is also true for expressions
 
I mean like ambiguity in terms of parsing e.g expr -> expr '+' expr | num
 
how is that ambiguous?
actually, if you look at my grammar, I have exactly that.
expression:
expression PERIOD IDENTIFIER |
expression argument_list |
expression OR expression |
expression AND expression |
expression (IS | EQ | NEQ) expression |
expression (LEQ | GEQ | LT | GT) expression |
expression (PLUS | MINUS) expression |
expression (MULT | DIV) expression |
OPEN_PAREN expression CLOSE_PAREN |
literal |
IDENTIFIER;
but if you do 4 + 5 + 6, it'll do (4 + 5) + 6 every time
 
2:14 PM
@NathanMerrill for 1+1+1, does it so [1+[1+1]] or [[1+1]+1]
 
the latter
bah, I found another bug in my grammar
it doesn't handle 1 + 1 +1 correctly
 
Ah I see, it goes top down on derivations
 
you don't use intellij, by chance?
because it makes it really nice. You can right-click an expression, and say "test expression"
so you don't have to test your entire program all at once
 
I use vim for almost everything >_>
 
2:54 PM
Hey @Dennis. You may get some extra load on the TIO servers startin 01:00 GMT to about 03:00 GMT. My class is allowed to use programs we wrote for the exam that morning, we wrote them in C, JS, and Python, so I showed them TIO so that they can use all of those without downloading a bunch of compilers
And the reason we're allowed to use programs is because the class is Numeric Methods. Royal pain in the butt
 
So you're allowed computers with internet access for the exam?
 
Numeric methods is hard enough even with internet access
 
sigh community isn't the brightest bulb
 
Is that an automated process or an anonymous edit?
 
@Riker What's wrong with that?
@trichoplax Automated process. I've had dozens of my posts edited similarly.
 
3:21 PM
New half-baked answer-chaining challenge idea: to expand the concept of answer chaining so that it's not just a list (as is most common), not just a tree (as in Evolution of OEIS), but rather a directed acyclic graph. As in, a single answer can be chained off of multiple previous answers.
 
@Sherlock9 Thanks for the heads-up. How big is your class?
 
Why no cycles. Surely we could make something which could have preceded a previous entry
 
It's two combined. Computer science and physics from the class of 2015. Around 20-30 people
We are a small university
 
@fəˈnɛtɪk I suppose that is also possible, although it would have to work well with the rest of the challenge spec.
 
Wow uhh this is broken for IO
The whole chat
 
3:32 PM
Greetings.
 
Right now I'm thinking of a DAG answer-chaining challenge that uses a distance metric.
 
School computer by the way
 
@DownChristopher Stupid question, but why are you using Internet Exploiter?
oh
 
3:33 PM
@DownChristopher there's probably filtering in place
 
@DownChristopher Looks like a CSS didn't load
 
@AdmBorkBork meta.se into meta.se.
 
@Riker http into https
 
You would earn points either by (1) increasing the length of a chain or (2) converging multiple chains together.
 
@AdmBorkBork Yeah refreshing worked at fixing
$Ju$t thought of a $LaTeX$ troll
 
3:36 PM
3 hours ago, by Martin Ender
@HyperNeutrino it's your rep, you can give the bounty to whichever answer you like
i know there's context and stuff, but this struck me kind of interestingly
 
@Dennis Not sure you saw my messages so here they are again. "It's two classes combined. Computer Science majors and Physics majors from the class of 2015. Around 20-30 people. We are a small university."
 
0
A: Sandbox for Proposed Challenges

Valyrio AccountTwo Possible Questions I thought of both of these in succession and decided to only post 1 proposal with both challenges. For advice, start your comment with either 1) or 2) depending on which one you're helping with 1) 5 vowel words There are some words in the English language that have all ...

 
@AdmBorkBork ah didn't catch that
 
I think it's safe to say that I get all my news from xkcd at this point.
 
3:40 PM
I only know Unicode 10.0 is going to be a thing from today's comic.
 
Anyone have a good bounty I can win (with work ofc but most of the ones are all going to one user for a cool answer)
 
Do they even do anything but add new emoji at this point?
 
@Sherlock9 Yes, I saw. Just couldn't reply atm. Unless you all click run at the same time, TIO should be able to handle that.
 
Ooh, look, they're adding the bitcoin sign.
Bitcoin enthusiasts should be happy.
BTW, what's the correct way to sort a unicode strong containing combining characters and/or diacritics?
 
@Dennis So don't ddos?
 
3:42 PM
That;s not what a DDOS is.
 
sigh
I know that
It actually is in a form
 
Actually, now that I think about it, it kind of is.
 
If you get enough people to do it stuff will slow down
 
It's not an attack if everyone happens to click the button at the same time, but the acronym doesn't actualy specify it has to be.
 
Yeah
@Dennis how do I check how much CPU power I used in TIO?
 
3:47 PM
You don't. Not even I know.
 
hmm
I need a way to check how much work tio has to do to run a program any ideas?
CC:@Dennis
CPU share may work
 
The debugging information shows both wall and consumed CPU time.
 
0
A: Sandbox for Proposed Challenges

ignasas kielasasDetect if image is inverted or not Challenge Detect if a given image is inverted, or not. Output can be any usual way, like True/False, 1/0 and so on. Images given will be images of nature, 50% of them inverted. Sample: Scoring Score is length/percentage of acuracy

 
Do you know what CPU is being used on the server? I'm sure DO gives you the specs.
 
I think the CPU time and CPU share would work
 
3:52 PM
You don't need CPU time and share. User and and sys time count cycles, not how many seconds have elapsed.
 
@Dennis Thanks for the info :D See you around
 
@ГригорийПерельман DO does no such thing, but you can check yourself. tio.run/nexus/bash#@5@cWKKgX1CUn6yfXFCamZeW//8/AA
 
I am trying to figure a way of checking how much power is used on TIO for a challenge. I need it to grade. The submissions have a set time to run
DO?
 
Hello
 
it's me
 
3:55 PM
@fergusq I mean, does it first parse everything and detect errors, or does it start running it and then break if there's a syntax error only if it's in reachable code? Basically, can I put garbage the an exit command?
An ad-hoc parser is better for polyglots and restricted-source and such but generally worse for practicality.
@DownChristopher Digital Ocean, the company that provides the TIO servers.
 
@ГригорийПерельман o
 
Is there a command to see all of a computer's system information in Linux, like Windows' dxdiag?
 

« first day (2242 days earlier)      last day (2592 days later) »