Kieran Shanley kieranshanley

## issTle
#!/usr/bin/python3

from tletools import TLE

tle_string = """
ISS (ZARYA)
1 25544U 98067A   22201.40857775  .00008240  00000+0  15195-3 0  9997
2 25544  51.6419 172.0419 0005020  30.4744  71.6173 15.50043356350332
"""

## LL1-parser-first-follow-sets.js
/**
 * LL(1) parser. Building parsing table, part 1: First and Follow sets.
 *
 * by Dmitry Soshnikov <dmitry.soshnikov@gmail.com>
 * MIT Style License
 *
 * An LL(1)-parser is a top-down, fast predictive non-recursive parser,
 * which uses a state-machine parsing table instead of recursive calls
 * to productions as in a recursive descent parser.
 *
	#!/usr/bin/python3

	from tletools import TLE

	tle_string = """
	ISS (ZARYA)
	1 25544U 98067A 22201.40857775 .00008240 00000+0 15195-3 0 9997
	2 25544 51.6419 172.0419 0005020 30.4744 71.6173 15.50043356350332
	"""
	/**
	* LL(1) parser. Building parsing table, part 1: First and Follow sets.
	*
	* by Dmitry Soshnikov <dmitry.soshnikov@gmail.com>
	* MIT Style License
	*
	* An LL(1)-parser is a top-down, fast predictive non-recursive parser,
	* which uses a state-machine parsing table instead of recursive calls
	* to productions as in a recursive descent parser.
	*