#include <stdio.h> 
#include <stdlib.h> 
#include <string.h> 
//legge la stringa fino al punto
char* sentence(char* s) 
{
	char* p1;
	char* p2;
	char *arr;
	short i;

	p1=s;
	p2=malloc(100);
	arr=p2;
	for(i=0; *p1!='.';i++) *p2++=*p1++;
	*p2='\0';

	return arr;
}
//carica la stringa in una matrice bidimensionale
char **carica(char* p, char **q, int i)
{
   q[i]=malloc(strlen(p));
   strcpy(q[i],p);
   return q;
}
//stampa la matrice bidimensionale
stampa (char **q,int N)
{
    int i;
    for(i=0;i<N;i++)
	printf("stampa: %s\n",q[i]);
}
//programma principale
void main() 
{ 
  char stringa[500]="Most of the knowledge on falls might be biased. Fall simulation are widely used in algorithm development. However the results of fall detection are not convincing. Students were instructed to fall on the back during Experiment 1. In Experiment 2, students were instructed not to fall, when possible, when released from a backward lean.  Data acquisition was performend using a tri-axial acceleration sensor."; 

   char* start=stringa; 
   char** q=malloc(10*sizeof(char*)); //spazio per 10 frasi
   char* p=NULL; 
   int i=0, N;
   while (*(p=sentence(start)) != '\0') 
   { 
      printf("%s\n",p); 
      q=carica(p,q,i);
      i++;
      start+=strlen(p)+2;
   } 	 
   N=i;
   stampa(q,N);
}