ptmcg
LightNews LightNews
ptmcg-pm.bsky.social
ptmcg
@ptmcg-pm.bsky.social
13 followers 40 following 29 posts
Author/maintainer of pyparsing, littletable, plusminus, logmerger; co-author of Python in a Nutshell 4th edition
Posts Replies Media Videos
ptmcg-pm.bsky.social
This past weekend I pushed version 3.3.1 of pyparsing to PyPI (3.3.0 had a small but CI-stopping packaging blip). Includes AI instructions of pyparsing best practices. Deprecated camelCase names now throw DeprecatedWarnings. TINY teaching language parser+REPL
#PythonDevelopment #python #pyparsing
Snippet of AI instructions, available by calling `pyparsing.show_best_practices()` from Python Example showing DeprecationWarning raised when calling pyparsing `parseString` instead of `parse_string` TINY code example of a leap year determination function. Complete code: int is_divisible(int a, int b) { float quo := a / b; int iquo := quo; return quo = iquo; } int is_leap_year(int yr) { int div_by_400 := is_divisible(yr, 400); if div_by_400 then return 1; end int div_by_100 := is_divisible(yr, 100); if div_by_100 then return 0; end int div_by_4 := is_divisible(yr, 4); return div_by_4; } int main() { string s; int year; int this_year; read this_year; repeat read yr; if yr = "q" then return 0; end year := yr; is_leap := is_leap_year(year); write year; write " "; if is_leap then if year > this_year then write "will be"; elseif year < this_year then write "was"; else write "is"; end else if year > this_year then write "will not be"; elseif year < this_year then write "was not"; else write "is not"; end end write " a leap year"; write endl; until 0 }
December 25, 2025 at 4:46 AM
ptmcg-pm.bsky.social
A TINY script for finding prime numbers
int is_divisible(int a, int b) { int quo := a / b; return quo * b = a; } int is_prime(int n) { if i = 2 || i = 3 || i = 5 || i = 7 then return 1; end if is_divisible(n, 2) then return 0; end if is_divisible(n, 3) then return 0; end if is_divisible(n, 5) then return 0; end if is_divisible(n, 7) then return 0; end /* n is prime, assuming it is not > 120 */ return 1; } int main() { int i := 2; repeat if is_prime(i) then write i; write endl; end i := i + 1; until i > 120 }
November 26, 2025 at 5:23 AM
ptmcg-pm.bsky.social
I just released version 0.13.0, with some significant performance speedups, and visibility to loading time while building the display DataTable. Changelog here: github.com/ptmcg/logmer...
Screenshot of the logmerger utility showing a time-based merge of two large log files, with a progress bar in the lower left corner.
November 15, 2025 at 5:08 PM
ptmcg-pm.bsky.social
Mini-gallery of business card-sized prints of my artwork. Submitting these to the Bee Cave Arts Foundation's Christmas Fair. Prints by moo.com #art #digitalart #beecaveartsfoundation
12 prints of colorful abstract art by Paul McGuire, printed on business cards with simple white and black frames. Arranged on my kitchen table, quarter show for scale.
October 1, 2025 at 5:42 AM
ptmcg-pm.bsky.social
The upcoming 3.3.0 release of pyparsing will include AI instructions for best practices when using this package. They can be accessed from the command-line using `python -m pyparsing.ai.show_best_practices` (They work for human developers too.) #python #pythondev #pyparsing #ai
Snippet extracted from the AI instructions that will be bundled with the upcoming 3.3.0 release of pyparsing: $ python -m pyparsing.ai.show_best_practices <!-- This file contains instructions for best practices for developing parsers with pyparsing, and can be used by AI agents when generating Python code using pyparsing. --> ## Planning - If not provided or if target language definition is ambiguous, ask for examples of valid strings to be parsed - Before developing the pyparsing expressions, define a Backus-Naur Form definition and save this in docs/grammar.md. Update this document as changes are made in the parser. ## Implementing - Import pyparsing using "import pyparsing as pp", and use that for all pyparsing references. - When writing parsers that contain recursive elements (using Forward() or infix_notation()), immediately enable packrat parsing for performance: `pp.ParserElement.enable_packrat()` (call this right after importing pyparsing). See https://pyparsing-docs.readthedocs.io/en/latest/HowToUsePyparsing.html. - For recursive grammars, define placeholders with `pp.Forward()` and assign later using the `<<=` operator; give Forwards meaningful names with `set_name()` to improve errors. - Use PEP8 method and argument names in the pyparsing API ("parse_string", not "parseString"). - Do not include expressions for matching whitespace in the grammar. Pyparsing skips whitespace by default. ...
September 29, 2025 at 5:51 AM
ptmcg-pm.bsky.social
Greetings, BlueSky-ers! I'm new here so I wanted to do a quick introduction. My name is Paul McGuire, I've been using Python for about 24 years. I maintain the #pyparsing package, which is about to have its release 3.3.0 next month. I also make digital art. #PythonDev #Python #Introduction
A digital art abstract image of blues and greens, with a ragged white bottom. The title of this piece is "wave" A digital art abstract image, mostly white, but with a field of pale colors in the lower left corner, with a ragged diagonal border running from upper left to lower right. In the middle of this border is an irregular clump of color, as if it were a stain from multiple colors of ink, washed over the side of a snowy ridge. The title of this piece is "water music II".
September 28, 2025 at 4:33 PM
ptmcg-pm.bsky.social
Here is a Heapq class wrapper around those heapq functions, if you really want to en-class-ify them.

Code is in the ALT text.
import heapq class Heapq[T]: def __init__(self, data: list[T] = None): self._data = data or [] heapq.heapify(self._data) def push(self, item: T): heapq.heappush(self._data, item) def pop(self) -> T: return heapq.heappop(self._data) def __len__(self) -> int: return len(self._data) def __repr__(self) -> str: return repr(self._data) hh = Heapq() hh.push(('b', 1000)) hh.push(('a', 3)) hh.push(('a', 1)) hh.push(('a', 2)) print(len(hh)) print(bool(hh)) while hh: print(hh.pop()) Output of the Heapq script: 4 True ('a', 1) ('a', 2) ('a', 3) ('b', 1000)
September 28, 2025 at 1:09 PM
ptmcg-pm.bsky.social
When was this posted?! wikispaces is long long gone. :( BUT! that code is now in the pyparsing Github repository in the examples directory, along with many others. github.com/pyparsing/py... A more up-to-date version is number_words.py in that directory, which can also generate a railroad diagram.
A portion of the railroad diagram for the pyparsing parser defined in number_words.py. The diagram was auto-generated using the pyparsing create_diagram() function.
September 26, 2025 at 6:40 PM