samebchase

#!/usr/bin/env raku

use v6.d;
use Grammar::Tracer;

grammar BalancedParens {
    token TOP { <balanced-paren> }

    token balanced-paren { <lparen> <balanced-paren>* <rparen> }
    

samebchase

#!/usr/bin/env raku

use v6.d;
use Grammar::Tracer;

grammar SimpleNs {
    token TOP { <simple-ns> }

    token simple-ns { <lparen> <ns-keyword> <.ws> <ns-name> <rparen> }

samebchase

#!/usr/bin/env raku

use v6.d;
use Grammar::Tracer;

grammar EmptyLispForm {
    token TOP { <lparen> <rparen> }

    token lparen { '(' }
    token rparen { ')' }

samebchase

#!/usr/bin/env raku

use v6.d;
#use Grammar::Tracer;

grammar RealisticNs {
    token TOP { <realistic-ns> }

    token realistic-ns { <lparen>
                           <ns-keyword> <.ws> <ns-name> <.ws>

samebchase

Parsing Clojure namespace forms using Raku grammars

One day, I started wondering if it would be possible to parse Clojure namespace forms and generate a dependency graph of the various namespaces used in a real-world Clojure project. While that was the original motivation, I ended up down the Raku grammar rabbit hole, and had an enjoyable time learning how to use them. I'm glad you're joining me in reliving that journey.

Background

samebchase

~ 
❯ timestamp-from-ms 1585725108000
2020-04-01T07:11:48Z
~ 
❯ timestamp-from-ms 1585725108000 +5:30
2020-04-01T12:41:48+05:30
~ 
❯ timestamp-from-ms 1585725108000 -5:30
2020-04-01T01:41:48-05:30
~ 

samebchase

#include <vector>
#include <cassert>
#include <iostream>
#include <forward_list>

using std::cout;
using std::cin;
using std::endl;

using std::vector;

samebchase

(* http://www.problemotd.com/problem/party-hat/ *)

open Core.Std;;
open Sequence;;

let print_party_hat height =
  let hat_width line_no =
    2*line_no + 1 in
  let print_char_n char n =
    String.make n char

samebchase

#include <map>
#include <tuple>
#include <vector>
#include <iostream>
#include <algorithm>

template<typename KeyType>
std::pair<KeyType, std::size_t> most_frequent_element(std::vector<KeyType> elts) {
    std::map<KeyType, std::size_t> frequency_table;
 

samebchase

open Graph

module Vertex = struct
  type t = string
  let compare = Pervasives.compare
  let hash = Hashtbl.hash
  let equal = (=)
end

module Edge = struct