Claremont Isles National Park

Claremont Isles is a national park located in Queensland, Australia, 1783 km northwest of Brisbane. Established in 1989, the isles are managed by the Queensland Parks and Wildlife Service.

Claremont Isles National Park
Queensland
IUCN category II (national park)
Claremont Isles National Park
Coordinates13°54′40″S 143°50′02″E
Established1989
Area0.41 km2 (0.16 sq mi)
Managing authoritiesQueensland Parks and Wildlife Service
See alsoProtected areas of Queensland

The isles constitute an important breeding and roosting habitat for a variety of birds, specially seabirds. The habitat consists of coral reefs and swaths of offshore seagrass. This makes it a unique habitat for the birds. To preserve the area, going ashore is prohibited.[1]

Wildlife
Pied imperial pigeon
Beach stone-curlew

The isles provided habitat to a variety of birds and animals.

Birds

There are three islands in the Claremont Isles National Park: Fife, Pelican and Burkitt islands. All three islands have breeding populations of terns. Burkitt Island is an important breeding ground for the pied imperial pigeon. Migratory species such as the beach stone-curlew also flock to the island's extensive sand flats and lagoons. Australian terns lend the Pelican Island their name and Fife Island is famous for its population of wedge-tailed shearwaters.[2]

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. "Claremont Isles National Park". The State of Queensland (Department of National Parks, Recreation, Sport and Racing). Retrieved 5 July 2013.
  2. "About Claremont Isles". The State of Queensland (Department of National Parks, Recreation, Sport and Racing). Retrieved 5 July 2013.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.