In the fewest number of terms (application/parentheses are free), write a lazy K program that takes a single character of input and outputs it a fixed finite number of times which is at least ten thousand.
Here's an interpreter you can use:
http://lazy-k.appspot.com/
Fuzzy Octo Guacamole, 58/2 + 1 + 1 + 1 = 32 byte-points
"Hi, Hello!""Hello, bye!"%@0{25*!5[X2a]@}"+-+"X"| |"X"+-+"
This code as-is prints Hi, Hello!. By changing the % to a space (), you get Hello, bye!. By changing the first @ to a space (), you get the list of odd numbers, starting with 5 a...
Related: On the Subject of Keypads
In Keep Talking and Nobody Explodes, players are tasked with defusing bombs based on information from their "experts" (other people with a manual). Each bomb is made up of modules, one of which can be passwords, where the expert is given this list of possible p...
> I'm sorry, I can't come to chat right now. If you'd like to leave a message, please do so with a ping attached. I'll get back to you in the order you deserve.
Basically I have a function that returns a lambda that looks something like lambda foo: x(foo) or y(foo), but x might modify foo so if I backtrack to y I need to have the original foo
I was going to store it a dictionary with the keys being some unique identifier but I think I could do something better with a stack
My colleague just blasted me on bitbucket about using incorrect versioning in one of my open PRs... I was like "I just haven't pulled in latest yet" and he was like "oh".
they are stored in a global scope hashmap in the form of var_name: var_val where var_val contains variable information along with the variable's actual value
(assuming the variable was declared in global scope)
* in Pytek will be Python's splat, so that's not really an option. Well, actually, that could work. It's just an unary operator, and if the element being operated on is a reference, then...
What makes a language strongly typed? I'm looking for the most important aspects of a strongly typed language.
Yesterday I asked if PowerShell was strongly typed, but no one could agree on the definition of "strongly-typed", so I'm looking to clarify the definition.
Feel free to link to wikiped...
@Quill Optional in Pytek. If you don't specify a type, then it can be changed, a la Python. On the other hand, if you do specify a type, then it's restricted to that type.
@Downgoat In some cases.
For instance, since << is concatenation, "5" << 5 will cast the second 5 to string, and then concatenate. User-defined types will have to define these casts, if applicable and/or desired.
I see these terms bandied around all over the place in programming and I have a vague notion of what they mean. A search shows me that such things have been asked all over stack overflow in fact. As far as I'm aware Static/Dynamic typing in languages is subtly different to Strong/Weak typing but ...
(I should probably clarify that what I mean by "later usefulness" is whether the functionality you're looking at now will help you better express ideas in code once you understand it.)
@MarsUltor oh, ok, yeah, I am working on a PCRE-binding for node, so you can use PCRE (?(DEFINE)) blocks to define lexers. That will make tokenizing a breeze
Jison doesn't give Cheddar the flexibility it needs for errors and all
Also, you're not given the weights in a C-readable format?
*no parens/plus in the formula
If you aren't given anything, just have isLowerCase, isUpperCase, isDigit, and read until another uppercase -> lookup the hash in a switch-case or something
Over on Puzzling.SE, the community there has been discussing various ways to reward puzzle authors for creating exemplary puzzles. Given that we're like Puzzling.SE in that we're not a Q&A site, and that we've discussed increasing reputation gain/loss for challenge upvotes and downvotes, it seems...
Yeah, I know. It's also on my list to get rid of it, they force a very horrible quote and code block style as well as the footer... Goddamn is that footer ugly
I have a folder of JS stuff that I want to create a repo from because I need help, but then it's got horrible (CR would probably rate it -5/10) code quality
Also, everything in it is ~90% unfinished
Mainly, I'm not sure how many people 1. actually use JS, and 2. want to help
In the fewest number of terms (application/parentheses are free), write a lazy K program that takes a single character of input and outputs it a fixed finite number of times which is at least ten thousand.
Here's an interpreter you can use:
http://lazy-k.appspot.com/
Fuzzy Octo Guacamole, 58/2 + 1 + 1 + 1 = 32 byte-points
"Hi, Hello!""Hello, bye!"%@0{25*!5[X2a]@}"+-+"X"| |"X"+-+"
This code as-is prints Hi, Hello!. By changing the % to a space (), you get Hello, bye!. By changing the first @ to a space (), you get the list of odd numbers, starting with 5 a...
