Coat of arms of Castile and León

The coat of arms of Castile and León depicts the traditional arms of Castile (the yellow castle) quartered with the arms of León (the purple lion). It is topped with a royal crown.

Coat of arms of Castile and León
ArmigerCastile and León
Adopted1230
CrestA former royal crown
(without arches, orb and cross)
BlazonQuarterly: 1 and 4 Castile, 2 and 3 León

The lion design is attributed to Alfonso VII,[1] who became king of Castile and León in 1126. The castle symbol is attributed to his grandson Alfonso VIII,[1] In 1230, Ferdinand III united the two kingdoms and quartered the arms as a symbol of the union.[1] Until the sixteenth century, a full castle, with walls and three towers, rather than the current town design, was used.[2]

Its original elements are used not only in the current autonomous community of Castilla y León, but also in the national coat of arms of Spain, in municipal arms like the coat of arms of Toledo and in coats of arms of many former territories which belonged to the Crown of Castile, like Jaén or Los Angeles, California.

Also appears on Catholic diocese coat of arms of Diocese of St. Petersburg, Archdiocese of Santa Fe, Diocese of St. Petersburg and Roman Catholic Archdiocese of Manila.

In history

Castile and León autonomous community

In the world

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.

See also

References

  1. Flag, emblem and coat of arms. Junta de Castilla y León website. Accessed January 26, 2008.
  2. http://flagspot.net/flags/es-cl_hi.html The flag at Flags of the World.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.