Li Jukui

Li Jukui (Chinese: 李聚奎; 1904–1995) was a Chinese general and politician. He was the Petroleum Industry Minister form 1955 to 1959. Li Jukui served as the president of the Logistics Institute of the PLA.

This is a Chinese name; the family name is Li.
Li Jukui

Opposition to army crackdown in Tiananmen Square

During the Tiananmen Square protests of spring 1989, Li Jukui signed a letter opposing the enforcement of martial law by the Army in Beijing.

Due to the exigent circumstances, we as old soldiers, make the following request: Since the People's Army belongs to the people, it cannot stand against the people, much less kill the people, and must not be permitted to fire on the people and cause bloodshed; to prevent the situation from escalating, the Army must not enter the city.

— Ye Fei, Zhang Aiping, Xiao Ke, Yang Dezhi, Chen Zaidao, Song Shilun and Li Jukui, May 21, 1989 letter to the Central Military Commission and Capital Martial Law Command Headquarters[1]
gollark: Oh, right, array indexing.
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.

References
  1. (Chinese) Wu Renhua, "89天安门事件大事记：5月21日 星期日" Accessed 2013-07-12
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.