Changlin Li changlinli

I hereby claim:

To claim this, I am signing this object:

	/**
	* This is a bare-bones implementation of some parser combinators to implement
	* a simple Lisp-like parser.
	*
	* Note that I call it Lisp-like because I haven't yet defined any macro special
	* forms in the AST.
	*
	* I also use unrestricted recursion here which will eventually blow the stack
	* for sufficiently nested s-expressions. I could use trampolines instead to
	* trade stack for heap and avoid a stack overflow.

	package com.changlinli

	import cats.effect.{IO, Sync}
	import cats.free.Free
	import cats.implicits._
	import cats.~>

	import scala.language.higherKinds

	/*

	object Example {
	import fs2._
	import fs2.async.mutable._
	import cats._
	import cats.data._
	import cats.implicits._

	/**
	* This exists only because cats-effect keeps the trait expressing the
	* Concurrent instance of Kleisli package private, otherwise we could just

	object StandardUnit {
	type PersonId = Int

	final class Person(id: PersonId, name: String)

	object Person {
	def lookupName(id: PersonId): Option[String] = ???

	def lookupBlacklistStatus(id: PersonId): Option[Unit] = ???

	def group_by_n(line, n):
	if line == "":
	return []
	elif line[0] == " ":
	return [" "] + group_by_n(line[1:], n)
	else:
	return [line[:n]] + group_by_n(line[n:], n)

	with open("post.txt") as fp:
	final_string = ""