Shirley Crites

Shirley L. Crites (August 21, 1934 – December 28, 1990) was an infielder who played in the All-American Girls Professional Baseball League during the 1953 season. Crites batted and threw right-handed. She was born in Cape Girardeau, Missouri.[1]

Shirley Crites
All-American Girls Professional Baseball League
Infielder
Born: (1934-08-21)August 21, 1934
Cape Girardeau, Missouri
Died: December 28, 1990(1990-12-28) (aged 56)
Phoenix, Arizona
Batted: Right Threw: Right
Teams
Career highlights and awards
  • Postseason appearance (1953)
  • Women in Baseball – AAGPBL Permanent Display
    at Baseball Hall of Fame and Museum (1988)

"Squirrely", as her teammates nicknamed her, played briefly for the 1953 pennant-winning Fort Wayne Daisies. She hit a .129 average in 47 games, appearing mainly at third base as a backup to incumbent Catherine Horstman, which gave manager Bill Allington the chance to use Hortsman more as a pitcher.

Fort Wayne clinched the title with a 66–39 record, 4½ games ahead of the Grand Rapids Chicks, but lost to the Kalamazoo Lassies in the first round series. Crites went 0-for-3 in a playoff game.[2][3]

Crites is part of Women in Baseball, a permanent display based at the Baseball Hall of Fame and Museum in Cooperstown, New York, which was unveiled in 1988 to honor the entire All-American Girls Professional Baseball League.

She died in 1990 in Phoenix, Arizona, at the age of 56.[4]

Career statistics

Batting

GPABRH2B3BHRRBISBTBBBSOBAOBPSLG
471321517310117221517.129.218.145

Fielding

GPPOAETCDPFA
204192111445.924

[1][5]

Sources

  1. "All-American Girls Professional Baseball League – Shirley Crites". Retrieved 2019-03-29.
  2. 1953 Fort Wayne Daisies. Retrieved 2019-03-29.
  3. All-American Girls Professional Baseball League Record BookW. C. Madden. Publisher: McFarland & Company, 2000. Format: Softcover, 294pp. Language: English. ISBN 978-0-7864-3747-4
  4. Bollinger County, Missouri Genealogy – Shirley L. Crites entry
  5. All-American Girls Professional Baseball League Record Book
gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```
gollark: <@332271551481118732> Expression parsing is done, I think.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.
gollark: This will allow 3% more efficient harnessing of character set anomalies.
gollark: The parser supports anomalous unicode, muahaha.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.