Fast Parse
Advent_of_Code_in_Pascal
Fast Parse | Advent_of_Code_in_Pascal | |
---|---|---|
4 | 23 | |
1,076 | 8 | |
0.2% | - | |
4.6 | 0.0 | |
21 days ago | over 1 year ago | |
Scala | Pascal | |
MIT License | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Fast Parse
-
How do I remove the forward reference error in my parser? (20 lines)
Perhaps use Li Haoyi's fastparse instead? https://github.com/com-lihaoyi/fastparse
-
Parse slightly dirty, poorly escaped XML
You might want to adapt Li Haoyi’s XML parser for fastparse.
-
-🎄- 2021 Day 18 Solutions -🎄-
Mostly a mess of pattern matching. I really need to make some generic tree utilities. Haven't been able to find a decent parser combinator that works in Scala 3 (I usually use fastparse which depends heavily on Scala 2 macros, and scala-parser-combinators works in Scala 3, but I've had a lot of trouble getting it to not be too greedy), so I used the state monad from cats to parse at the bottom of the file, which I think turned out fairly nice.
-
Parser generators vs. handwritten parsers: surveying major languages in 2021
Agreed! I would say that parser combinators are the sweet spot and the right choice in most cases.
Scala has them as well, e.g.: https://com-lihaoyi.github.io/fastparse/
And the good thing is, you don't have to learn a completely new language/syntax, you can use the host language's syntax and you have full IDE support as well.
Advent_of_Code_in_Pascal
-
Advent of Code 2022
I'm doing it in Lazarus/Free Pascal again.
https://github.com/mikewarot/Advent_of_Code_in_Pascal
-
-🎄- 2021 Day 22 Solutions -🎄-
Free Pascal - 2251/1744 34.5 seconds runtime No objects, no recursion After brute forcing part 1, I stared at part 2 until I though only handling the different values of X,Y,Z and letting the grid represent variable size cubes.. only to hit memory size limits anyway... and then I learned how to use BITPACKED array, and was able to eventually brute force part 2. Whew!
-
-🎄- 2021 Day 21 Solutions -🎄-
Pascal 2235/4609
-
-🎄- 2021 Day 18 Solutions -🎄-
Pascal - Github
-
-🎄- 2021 Day 16 Solutions -🎄-
Pascal 7079/6330 - github
-
-🎄- 2021 Day 15 Solutions -🎄-
Github - https://github.com/mikewarot/Advent_of_Code_in_Pascal/blob/master/2021/advent2021_15b.lpr
-
day 13 result issue, someone can help?
My pascal based solver eventually got valid text out of your input.
- -🎄- 2021 Day 13 Solutions -🎄-
-
-🎄- 2021 Day 9 Solutions -🎄-
Pascal 2437/6187
-
-🎄- 2021 Day 8 Solutions -🎄-
Pascal 3590/5744
What are some alternatives?
Parboiled2 - A macro-based PEG parser generator for Scala 2.10+
mORMot2 - OpenSource RESTful ORM/SOA/MVC Framework for Delphi and FreePascal
Scala Parser Combinators - simple combinator-based parsing for Scala. formerly part of the Scala standard library, now a separate community-maintained module
aoc2020 - Advent of Code 2020 - my answers
atto - friendly little parsers
advent-of-code - My solutions for Advent of Code
Scopt - command line options parsing for Scala
aoc-2020 - Advent of Code 2020
Kaitai Struct - Kaitai Struct: declarative language to generate binary data parsers in C++ / C# / Go / Java / JavaScript / Lua / Nim / Perl / PHP / Python / Ruby
advent-of-code-2020 - 🎅🌟❄️☃️🎄🎁
decline - A composable command-line parser for Scala.
Advent-of-Code - Advent of Code