Skip to main content
The 2025 Developer Survey results are in. Explore insights into technology and tools, careers, community and more. View results.

All Questions

Tagged with
Filter by
Sorted by
Tagged with
3 votes
1 answer
183 views

Getting all column vs. table regardless of alias using JSqlParser

I have been trying to get all column vs. table regardless of alias used, for example, assume this query ...
srilakshmikanthanp's user avatar
0 votes
2 answers
1k views

Good practices for parsing this text file

I have the following .txt file structure that i want to parse in Java(8): ...
singh raj's user avatar
2 votes
1 answer
170 views

Call URL x times where x is in the JSON response after the first call

I have to make an HTTP POST request by passing header and body. In the body, I need to provide a pageNumber before posting data so I am starting with "1" initially. ...
user1950349's user avatar
1 vote
1 answer
631 views

Website Spell Checker in Java - follow-up

After receiving some great feedback on my original program, I tried to implement everything that was shared and I just want to see if there's anything else that I can change to make my program clean ...
ary's user avatar
  • 55
4 votes
2 answers
2k views

Website Spell Checker in Java

I've implemented a program that spell checks a website. Here is the idea that I have in mind: Scan all of the words in a web page into a string (using jsoup) Filter out all of the HTML markup and ...
ary's user avatar
  • 55
3 votes
1 answer
97 views

Parsing speech out of text

I'm working on an experiment to parse speech out of an emote in a text roleplaying game (MUD) so that if you can't hear it correctly, or if it's in a different language, you won't understand it. This ...
BrainFRZ's user avatar
  • 841
3 votes
0 answers
937 views

Expression parser using Shunting-yard algorithm

I've been working on a expression parser which will be part of another project (some sort of DSL). This parser basically uses the Shunting-yard algorithm, except for the case of parenthesis: here it ...
Tim's user avatar
  • 143
4 votes
1 answer
4k views

Boolean expressions from infix to postfix notation using Dijkstra's Shunting Yard algorithm

I began working on a Java library that receives a boolean expression such as not A and (B or not C), compiles it to a circuit of logical gates \$\mathcal{C}\$, ...
coderodde's user avatar
  • 31k