Licin
For the area in Sumatra see Napal Licin and for the area in Kalimantan, Borneo see Batu Licin.
Licin | |
|---|---|
| Coordinates: 8.15857°S 114.23636°E | |
| Country | Indonesia |
| Region | Java |
| Province | East Java |
| Regency | Banyuwangi Regency |
| Time zone | UTC+7 (IWST) |
| Area code | (+62) 333 |
| Villages | 8 |
| Website | licin |
Licin is an area of the Banyuwangi Regency, East Java, Indonesia.
Henry Ogg Forbes identified Boea treubii of the genus Boea during his expeditions from 1878 until 1883. He described the flower as "sungularly beautiful" when he saw it in full flower November 1881 near Napal Litjin at 580 feet above sea level. among calcareous blocks near the summit of Karangnata amongst Caelogynes and "pink-fruited" Malastomacae. He named it in honor of Dr. Treub, director of the Buitenzorg Botanic Gardens.[1]
Gallery
Java family home "Ottolander" Litjin at 437 m (circa 1915)
Central Java Bamboo route from Litjin to the "kawah" at 750 m (circa 1915)
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
- A naturalist's wanderings in the Eastern archipelago ... from 1878 to 1883 Henry Ogg Forbes, Low Sampson, Marston, Searle & Rivington, 1885 page 279
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.